← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Sequential Facility Location: Approximate Submodularity and Greedy Algorithm ICML 2019
Exploiting structure of uncertainty for efficient matroid semi-bandits ICML 2019
Submodular Observation Selection and Information Gathering for Quadratic Models ICML 2019
Optimality and Nash Stability in Additive Separable Generalized Group Activity Selection Problems IJCAI 2019
Reachability and Coverage Planning for Connected Agents IJCAI 2019
Anytime Heuristic for Weighted Matching Through Altruism-Inspired Behavior IJCAI 2019
Reallocating Multiple Facilities on the Line IJCAI 2019
Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions IJCAI 2019
Entropy-Penalized Semidefinite Programming IJCAI 2019
Acquiring Integer Programs from Data IJCAI 2019
Resolution and Domination: An Improved Exact MaxSAT Algorithm IJCAI 2019
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover IJCAI 2019
Branch-and-Cut-and-Price for Multi-Agent Pathfinding IJCAI 2019
Minimizing Time-to-Rank: A Learning and Recommendation Approach IJCAI 2019
Athanor: High-Level Local Search Over Abstract Constraint Specifications in Essence IJCAI 2019
Constraint Programming for Mining Borders of Frequent Itemsets IJCAI 2019
Preferred Deals in General Environments IJCAI 2019
A Parameterized Perspective on Protecting Elections IJCAI 2019
Schelling Games on Graphs IJCAI 2019
Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories IJCAI 2019
Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms IJCAI 2019
Submodular Batch Selection for Training Deep Neural Networks IJCAI 2019
Constraint-Based Scheduling with Complex Setup Operations: An Iterative Two-Layer Approach IJCAI 2019
Local Search with Efficient Automatic Configuration for Minimum Vertex Cover IJCAI 2019
Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning IJCAI 2019