← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Multi-Goal Multi-Agent Path Finding via Decoupled and Integrated Goal Vertex Ordering AAAI 2021
Multi-Objective Submodular Maximization by Regret Ratio Minimization with Theoretical Guarantee AAAI 2021
Anytime Multi-Agent Path Finding via Large Neighborhood Search IJCAI 2021
Reaping the Benefits of Bundling under High Production Costs AISTATS 2021
Budget Feasible Mechanisms Over Graphs AAAI 2021
Dividing a Graphical Cake AAAI 2021
The Price of Connectivity in Fair Division AAAI 2021
Learning Interpretable Decision Rule Sets: A Submodular Optimization Approach NIPS 2021
On The Structure of Parametric Tournaments with Application to Ranking from Pairwise Comparisons NIPS 2021
Constrained Robust Submodular Partitioning NIPS 2021
Fair and Efficient Resource Allocation with Partial Information IJCAI 2021
Two-Sided Matching Meets Fair Division IJCAI 2021
Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure AAAI 2021
Optimal Quantization Using Scaled Codebook CVPR 2021
Group Testing on a Network AAAI 2021
End-to-End Constrained Optimization Learning: A Survey IJCAI 2021
Binary Matrix Factorisation via Column Generation AAAI 2021
Keep Your Distance: Land Division With Separation IJCAI 2021
The Parameterized Complexity of Connected Fair Division IJCAI 2021
Fractional Matchings under Preferences: Stability and Optimality IJCAI 2021
PROPm Allocations of Indivisible Goods to Multiple Agents IJCAI 2021
Necessary and Sufficient Conditions for Avoiding Reopenings in Best First Suboptimal Search with General Bounding Functions AAAI 2021
Spectral vertex sparsifiers and pair-wise spanners over distributed graphs ICML 2021
Decomposable Submodular Function Minimization via Maximum Flow ICML 2021
Weighted model counting with conditional weights for Bayesian networks UAI 2021