Combinatorial Optimization
2,615 papers
Papers per year
1
1
2
9
6
6
16
22
21
20
56
50
68
61
138
176
223
274
266
263
305
294
244
93
'5
'10
'15
'20
'25
Papers
Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract)
IJCAI 2021
Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub-Optimality
AAAI 2021
Accomplice Manipulation of the Deferred Acceptance Algorithm
IJCAI 2021
A Complexity-theoretic Analysis of Green Pickup-and-Delivery Problems
AAAI 2021
A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering
NeurIPS 2021
Adaptive Experimental Design for Optimizing Combinatorial Structures
IJCAI 2021
Adaptive Sampling for Fast Constrained Maximization of Submodular Functions
AISTATS 2021
Adaptivity in Adaptive Submodularity
COLT 2021
Adversarial Combinatorial Bandits with General Non-linear Reward Functions
ICML 2021
A Faster Maximum Cardinality Matching Algorithm with Applications in Machine Learning
NeurIPS 2021
A Fast Exact Algorithm for the Resource Constrained Shortest Path Problem
AAAI 2021
A Few Queries Go a Long Way: Information-Distortion Tradeoffs in Matching
AAAI 2021
Almost Envy-freeness, Envy-rank, and Nash Social Welfare Matchings
AAAI 2021
A Model of Winners Allocation
AAAI 2021
A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem
IJCAI 2021
An Improved Upper Bound for SAT
AAAI 2021
An Integer Linear Programming Framework for Mining Constraints from Data
ICML 2021
An LP-Based Approach for Goal Recognition as Planning
AAAI 2021
Answering Regular Path Queries Under Approximate Semantics in Lightweight Description Logics
AAAI 2021
Anytime Heuristic and Monte Carlo Methods for Large-Scale Simultaneous Coalition Structure Generation and Assignment
AAAI 2021
Anytime Multi-Agent Path Finding via Large Neighborhood Search
IJCAI 2021
Approximate Decomposable Submodular Function Minimization for Cardinality-Based Components
NeurIPS 2021
Approximate Group Fairness for Clustering
ICML 2021
Approximating the Permanent with Deep Rejection Sampling
NeurIPS 2021
A Runtime Analysis of Typical Decomposition Approaches in MOEA/D Framework for Many-objective Optimization Problems
IJCAI 2021