← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2407 directly classified papers

Papers per year

Papers

Learning to Optimize Combinatorial Functions ICML 2018
Complexity of Scheduling Charging in the Smart Grid IJCAI 2018
Optimal Solution of the Generalized Dubins Interval Problem RSS 2018
Stochastic Anytime Search for Bounding Marginal MAP IJCAI 2018
Algorithms for the Nearest Assignment Problem IJCAI 2018
Constant Factor Time Optimal Multi-Robot Routing on High-Dimensional Grids RSS 2018
Mixed Causal Structure Discovery with Application to Prescriptive Pricing IJCAI 2018
Passive Static Equilibrium with Frictional Contacts and Application to Grasp Stability Analysis RSS 2018
On the interaction between Autonomous Mobility-on-Demand systems and the power network: models and coordination algorithms RSS 2018
Weakly Submodular Maximization Beyond Cardinality Constraints: Does Randomization Help Greedy? ICML 2018
Quantifying Algorithmic Improvements over Time IJCAI 2018
Search Progress and Potentially Expanded States in Greedy Best-First Search IJCAI 2018
Boosting Combinatorial Problem Modeling with Machine Learning IJCAI 2018
Linear Satisfiability Preserving Assignments (Extended Abstract) IJCAI 2018
Towards Improving the Expressivity and Scalability of Distributed Constraint Optimization Problems IJCAI 2018
Pyconstruct: Constraint Programming Meets Structured Prediction IJCAI 2018
Solving Sudoku with Consistency: A Visual and Interactive Approach IJCAI 2018
Approximate Submodularity and its Applications: Subset Selection, Sparse Approximation and Dictionary Selection JMLR 2018
Generalized Rank-Breaking: Computational and Statistical Tradeoffs JMLR 2018
Greed is Still Good: Maximizing Monotone Submodular+Supermodular (BP) Functions ICML 2018
Solving M-Modes in Loopy Graphs Using Tree Decompositions PGM 2018
Learning Optimal Causal Graphs with Exact Search PGM 2018
Computing the Schulze Method for Large-Scale Preference Data Sets IJCAI 2018
Seeking Practical CDCL Insights from Theoretical SAT Benchmarks IJCAI 2018
A Fast Algorithm for Optimally Finding Partially Disjoint Shortest Paths IJCAI 2018