The program committee invites submissions that include but are not limited to the following topics:
Inference and relaxation methods: constraint propagation, cutting planes, global constraints, graph algorithms, dynamic programming, Lagrangian and convex relaxations, heuristic functions based on constraint relaxation.
Search methods: branch and bound, intelligent backtracking, incomplete search, randomized search, portfolios, column generation, Benders decompositions or any other decomposition methods, local search, meta-heuristics.
AI and Machine Learning techniques applied to solve optimization and Operations Research problems.
Integration methods: solver communication, model transformations and solver selection, parallel and distributed solving, combining machine learning with combinatorial optimization.
Modeling methods: comparison of models, symmetry breaking, uncertainty, dominance relationships.
Innovative applications of CP/AI/OR techniques.
Implementation of CP/AI/OR techniques and optimization systems.