Submissions have now closed.

The program committee invites submissions that include but are not limited to the following topics:

• Integration of constraint relaxation methods, e.g. constraint propagation, cutting planes, reduced costs, global constraints, graph algorithms, dynamic programming, Lagrangean and convex relaxations, heuristic functions based on constraint relaxation.
• Integration of search and solving methods, e.g. branch and bound, intelligent backtracking, incomplete search, randomized search, column generation and other decomposition methods, local search, meta-heuristics.
• Forms of integration, e.g. static/dynamic problem decomposition, linking variables and constraints in different solvers, transformations between models and solvers, methods using information derived by other solving methods, collaboration between concurrent methods, models, and solvers.
• Problems, modeling, and applications.

Papers should be at most 15 pages in length, and should be prepared in the format used for the Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/authors.html). It is planned that the proceedings will be published in the Springer Lecture Notes in Computer Science series (http://www.springer.de/comp/lncs/index.html). All papers are to be submitted electronically in a PDF or PS format by following the instructions at the URL http://tidel.mie.utoronto.ca/cpaior/

Following the conference, authors of all accepted papers will be invited to submit substantially extended versions of their papers to a special issue of the Annals of Operations Research devoted to papers from CP-AI-OR'06. These papers will undergo an additional, very thorough refereeing process and a selection of the best papers will be published.