The conference welcomes talks presenting results in all areas of combinatorial optimization and its applications. Topics of interest include, but are not limited to:
1. Algorithmic Approaches
Approximation algorithms
Branch-and-bound algorithms
Branch-and-cut-and price algorithms
Cutting plane algorithms
Exact and parameterized algorithms
2. Graph & Network Theory
Graph and network algorithms
Polyhedral combinatorics
Computational geometry
Scheduling algorithms
3. Mathematical Programming
Linear and nonlinear integer programming
Mixed integer programming
Interior point methods
Multiobjective optimization
Constraint Programming
4. Computational Methods
Local search algorithms
Metaheuristics
Randomized algorithms
On-line algorithms
Computational complexity
5. Emerging Technologies
Quantum optimization algorithms
Combinatorial optimization and machine learning
Computational biology