Research Explorer
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Papers
Trends
Conferences
Explore
Authors
Topics
Keywords
Achievements
About
Methodology
← Optimization
Mathematics & Optimization
›
Optimization
›
Combinatorial Optimization
2407 directly classified papers
Papers per year
2002: 1
2004: 1
2005: 2
2006: 9
2007: 6
2008: 5
2009: 16
2010: 20
2011: 19
2012: 19
2013: 53
2014: 48
2015: 67
2016: 61
2017: 137
2018: 174
2019: 220
2020: 270
2021: 264
2022: 259
2023: 295
2024: 230
2025: 149
2026: 82
Papers
Fairness in Streaming Submodular Maximization over a Matroid Constraint
ICML 2023
Skyplane: Optimizing Transfer Cost and Throughput Using Cloud-Aware Overlays
NSDI 2023
The Computational Complexity of Concise Hypersphere Classification
ICML 2023
PASTA: Pessimistic Assortment Optimization
ICML 2023
DevFormer: A Symmetric Transformer for Context-Aware Device Placement
ICML 2023
Combinatorial Causal Bandits
AAAI 2023
Optimizing NOTEARS Objectives via Topological Swaps
ICML 2023
Streaming Submodular Maximization with Differential Privacy
ICML 2023
Fast as CHITA: Neural Network Pruning with Combinatorial Optimization
ICML 2023
Maximum Independent Set: Self-Training through Dynamic Programming
NIPS 2023
Variational Annealing on Graphs for Combinatorial Optimization
NIPS 2023
Blossom: an Anytime Algorithm for Computing Optimal Decision Trees
ICML 2023
Necessary and Sufficient Conditions for Optimal Decision Trees using Dynamic Programming
NIPS 2023
Model-Based Control with Sparse Neural Dynamics
NIPS 2023
Kissing to Find a Match: Efficient Low-Rank Permutation Representation
NIPS 2023
Closing the Computational-Statistical Gap in Best Arm Identification for Combinatorial Semi-bandits
NIPS 2023
BQ-NCO: Bisimulation Quotienting for Efficient Neural Combinatorial Optimization
NIPS 2023
A Deep Instance Generative Framework for MILP Solvers Under Limited Data Availability
NIPS 2023
Diverse Approximations for Monotone Submodular Maximization Problems with a Matroid Constraint
IJCAI 2023
Lo-Hi: Practical ML Drug Discovery Benchmark
NIPS 2023
Size-constrained k-submodular maximization in near-linear time
UAI 2023
Learning to Break Symmetries for Efficient Optimization in Answer Set Programming
AAAI 2023
Solving the Identifying Code Set Problem with Grouped Independent Support
IJCAI 2023
Streaming Algorithms and Lower Bounds for Estimating Correlation Clustering Cost
NIPS 2023
ProteinInvBench: Benchmarking Protein Inverse Folding on Diverse Tasks, Models, and Metrics
NIPS 2023
<
1
…
23
24
25
…
97
>