← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Efficient Projection onto the Perfect Phylogeny Model NIPS 2018
Multi-Agent Election-Based Hyper-Heuristics IJCAI 2018
Multi-Sentence Compression with Word Vertex-Labeled Graphs and Integer Linear Programming NAACL 2018
Improving Coverage and Runtime Complexity for Exact Inference in Non-Projective Transition-Based Dependency Parsers NAACL 2018
Maximum Selection and Sorting with Adversarial Comparators JMLR 2018
Double Auctions in Markets for Multiple Kinds of Goods IJCAI 2018
Designing the Game to Play: Optimizing Payoff Structure in Security Games IJCAI 2018
Conflict Directed Clause Learning for Maximum Weighted Clique Problem IJCAI 2018
Approximation Guarantees of Stochastic Greedy Algorithms for Subset Selection IJCAI 2018
A Scalable Scheme for Counting Linear Extensions IJCAI 2018
Solving Multi-Agent Path Finding on Strongly Biconnected Digraphs (Extended Abstract) IJCAI 2018
Boosting MCSes Enumeration IJCAI 2018
Compact-MDD: Efficiently Filtering (s)MDD Constraints with Reversible Sparse Bit-sets IJCAI 2018
A COP Model for Graph-Constrained Coalition Formation (Extended Abstract) IJCAI 2018
Complexity of n-Queens Completion (Extended Abstract) IJCAI 2018
Solving Patrolling Problems in the Internet Environment IJCAI 2018
On the Complexity of Chore Division IJCAI 2018
Customer Sharing in Economic Networks with Costs IJCAI 2018
Learning Certifiably Optimal Rule Lists for Categorical Data JMLR 2018
A Framework for Constraint Based Local Search using Essence IJCAI 2018
Solving (Weighted) Partial MaxSAT by Dynamic Local Search for SAT IJCAI 2018
Core-Guided Minimal Correction Set and Core Enumeration IJCAI 2018
Combinatorial Auctions via Machine Learning-based Preference Elicitation IJCAI 2018
Efficient Computation of Approximate Equilibria in Discrete Colonel Blotto Games IJCAI 2018
Simple, Robust and Optimal Ranking from Pairwise Comparisons JMLR 2018