← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Fair Division of a Graph IJCAI 2017
Voting by sequential elimination with few voters IJCAI 2017
Object Allocation via Swaps along a Social Network IJCAI 2017
Using Constraint Programming to solve a Cryptanalytic Problem IJCAI 2017
Multiwinner Rules on Paths From k-Borda to Chamberlin–Courant IJCAI 2017
Learning Sparse Combinatorial Representations via Two-stage Submodular Maximization ICML 2016
The Chordal Graph Polytope for Learning Decomposable Models PGM 2016
Assortment Optimization Under the Mallows model NIPS 2016
Computing and maximizing influence in linear threshold and triggering models NIPS 2016
Multiple Model Fitting as a Set Coverage Problem CVPR 2016
Tightness of LP Relaxations for Almost Balanced Models AISTATS 2016
Joint Probabilistic Matching Using m-Best Solutions CVPR 2016
Guaranteed Outlier Removal With Mixed Integer Linear Programs CVPR 2016
On the Reducibility of Submodular Functions AISTATS 2016
Combinatorial Multi-Armed Bandit and Its Extension to Probabilistically Triggered Arms JMLR 2016
How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods COLT 2016
On Valid Optimal Assignment Kernels and Applications to Graph Classification NIPS 2016
GIFT: A Real-Time and Scalable 3D Shape Search Engine CVPR 2016
Hardness of Online Sleeping Combinatorial Optimization Problems NIPS 2016
A Constant-Factor Bi-Criteria Approximation Guarantee for k-means++ NIPS 2016
Feature-distributed sparse regression: a screen-and-clean approach NIPS 2016
Tensor Power Iteration for Multi-Graph Matching CVPR 2016
Solving Temporal Puzzles CVPR 2016
The Product Cut NIPS 2016
Learning Sparse Additive Models with Interactions in High Dimensions AISTATS 2016