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
A Variant of Concurrent Constraint Programming on GPU
AAAI 2022
A View of Exact Inference in Graphs from the Degree-4 Sum-of-Squares Hierarchy
AISTATS 2022
A Weighting-Based Tabu Search Algorithm for the p-Next Center Problem
IJCAI 2022
Balancing the Spread of Two Opinions in Sparse Social Networks (Student Abstract)
AAAI 2022
BandMaxSAT: A Local Search MaxSAT Solver with Multi-armed Bandit
IJCAI 2022
Batch Bayesian Optimization on Permutations using the Acquisition Weighted Kernel
NeurIPS 2022
Batch-Size Independent Regret Bounds for Combinatorial Semi-Bandits with Probabilistically Triggered Arms or Independent Arms
NeurIPS 2022
Bayesian Optimization over Permutation Spaces
AAAI 2022
Best Heuristic Identification for Constraint Satisfaction
IJCAI 2022
Blocking Influence at Collective Level with Hard Constraints (Student Abstract)
AAAI 2022
Body-Decoupled Grounding via Solving: A Novel Approach on the ASP Bottleneck
IJCAI 2022
Branch & Learn for Recursively and Iteratively Solvable Problems in Predict+Optimize
NeurIPS 2022
Budgeted Sequence Submodular Maximization
IJCAI 2022
Can Hybrid Geometric Scattering Networks Help Solve the Maximum Clique Problem?
NeurIPS 2022
Certified Symmetry and Dominance Breaking for Combinatorial Optimisation
AAAI 2022
Cetus: Releasing P4 Programmers from the Chore of Trial and Error Compiling
NSDI 2022
Chapter Ordering in Novels
EMNLP 2022
Chromatic Correlation Clustering, Revisited
NeurIPS 2022
Combating Collusion Rings Is Hard but Possible
AAAI 2022
Combinatorial Bandits with Linear Constraints: Beyond Knapsacks and Fairness
NeurIPS 2022
Combinatorial Bayesian optimization with random mapping functions to convex polytopes
UAI 2022
Combining Clause Learning and Branch and Bound for MaxSAT (Extended Abstract)
IJCAI 2022
Combining (Second-Order) Graph-Based and Headed-Span-Based Projective Dependency Parsing
ACL 2022
Computing Diverse Shortest Paths Efficiently: A Theoretical and Experimental Study
AAAI 2022
Conflict-Based Steiner Search for Multi-Agent Combinatorial Path Finding
RSS 2022