The aim of the conference is to bring together interested researchers from Constraint Programming (CP), Artificial Intelligence (AI), and Operations Research (OR) to present new techniques or applications and to provide an opportunity for researchers in one area to learn about techniques in the others. A main objective of this conference series is also to give these researchers the opportunity to show how the integration of techniques from different fields can lead to interesting results on large and complex problems. Therefore, papers that actively combine, integrate, or contrast approaches from more than one of the areas are especially solicited. High quality papers from a single area are also welcome, if they are of interest to other communities involved. Application papers showcasing CP/AI/OR techniques on novel and challenging applications or experience reports on such applications are strongly encouraged.
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.
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.
06月26日
2018
06月29日
2018
初稿截稿日期
初稿录用通知日期
终稿截稿日期
注册截止日期
留言