conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

2
20
67
270
149
'05
'10
'15
'20
'25

Papers

Improved Guarantees for Offline Stochastic Matching via new Ordered Contention Resolution Schemes NIPS 2021
Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach NIPS 2021
Robust Allocations with Diversity Constraints NIPS 2021
Coresets for Decision Trees of Signals NIPS 2021
Optimal Kidney Exchange with Immunosuppressants AAAI 2021
When Hashing Met Matching: Efficient Spatio-Temporal Search for Ridesharing AAAI 2021
IA-GM: A Deep Bidirectional Learning Method for Graph Matching AAAI 2021
New Length Dependent Algorithm for Maximum Satisfiability Problem AAAI 2021
Counting Maximal Satisfiable Subsets AAAI 2021
Combining Reinforcement Learning and Constraint Programming for Combinatorial Optimization AAAI 2021
Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021
A Sharp Leap from Quantified Boolean Formula to Stochastic Boolean Satisfiability Solving AAAI 2021
An Improved Upper Bound for SAT AAAI 2021
Solving Infinite-Domain CSPs Using the Patchwork Property AAAI 2021
Disjunctive Temporal Problems under Structural Restrictions AAAI 2021
Cutting to the Core of Pseudo-Boolean Optimization: Combining Core-Guided Search with Cutting Planes Reasoning AAAI 2021
Optimising Automatic Calibration of Electric Muscle Stimulation AAAI 2021
Certifying Parity Reasoning Efficiently Using Pseudo-Boolean Proofs AAAI 2021
Finding Diverse Trees, Paths, and More AAAI 2021
Integrated Optimization of Bipartite Matching and Its Stochastic Behavior: New Formulation and Approximation Algorithm via Min-cost Flow Optimization AAAI 2021
Binary Matrix Factorisation via Column Generation AAAI 2021
Backdoor Decomposable Monotone Circuits and Propagation Complete Encodings AAAI 2021
On Continuous Local BDD-Based Search for Hybrid SAT Solving AAAI 2021
Symmetric Component Caching for Model Counting on Combinatorial Instances AAAI 2021
Parameterizing Branch-and-Bound Search Trees to Learn Branching Policies AAAI 2021