conftrace_
← Optimization
Mathematics & Optimization › Optimization ›

Combinatorial Optimization

2,409 papers

Papers per year

2
20
67
270
149
'05
'10
'15
'20
'25

Papers

A Parameterized Perspective on Protecting Elections IJCAI 2019
Schelling Games on Graphs IJCAI 2019
Reallocating Multiple Facilities on the Line IJCAI 2019
On the Efficiency and Equilibria of Rich Ads IJCAI 2019
Almost Envy-Freeness in Group Resource Allocation IJCAI 2019
Improved Heuristics for Multi-Agent Path Finding with Conflict-Based Search IJCAI 2019
Computational Aspects of Equilibria in Discrete Preference Games IJCAI 2019
Leadership in Congestion Games: Multiple User Classes and Non-Singleton Actions IJCAI 2019
Graphical One-Sided Markets IJCAI 2019
Aggregating Incomplete Pairwise Preferences by Weight 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
How to Tame Your Anticipatory Algorithm IJCAI 2019
Predict+Optimise with Ranking Objectives: Exhaustively Learning Linear Functions IJCAI 2019
Enumerating Potential Maximal Cliques via SAT and ASP IJCAI 2019
Entropy-Penalized Semidefinite Programming IJCAI 2019
Acquiring Integer Programs from Data IJCAI 2019
Stochastic Constraint Propagation for Mining Probabilistic Networks IJCAI 2019
Constraint-Based Scheduling with Complex Setup Operations: An Iterative Two-Layer Approach IJCAI 2019
Phase Transition Behavior of Cardinality and XOR Constraints IJCAI 2019
Unifying Search-based and Compilation-based Approaches to Multi-agent Path Finding through Satisfiability Modulo Theories IJCAI 2019
Integrating Pseudo-Boolean Constraint Reasoning in Multi-Objective Evolutionary Algorithms IJCAI 2019
Resolution and Domination: An Improved Exact MaxSAT Algorithm IJCAI 2019
Conditions for Avoiding Node Re-expansions in Bounded Suboptimal Search IJCAI 2019
An Efficient Evolutionary Algorithm for Minimum Cost Submodular Cover IJCAI 2019