Submissions have now closed.

Accepted Papers

A HYBRID COLUMN GENERATION AND CONSTRAINT PROGRAMMING OPTIMIZER FOR THE
TAIL ASSIGNMENT PROBLEM
Sami Gabteni and Mattias Grönkvist

A TOTAL UNIMODULAR DESCRIPTION OF THE CONSISTENT VALUE POLYTOPE
Ionut Aron, Daniel Leventhal, and Meinolf Sellmann

ALLOCATION, SCHEDULING AND VOLTAGE SCALING ON ENERGYAWARE MPSOCS
Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano

AN EFFICIENT AND INTEGRATED STRATEGY FOR TEMPORAL PLANNING
Xing Zhao, Yixin Chen, Weixiong Zhang

AND/OR BRANCH-AND-BOUND SEARCH FOR PURE 0/1 INTEGER LINEAR PROGRAMMING
PROBLEMS
Radu Marinescu, Rina Dechter

CONDITIONAL LEXICOGRAPHIC ORDERS IN CONSTRAINT SATISFACTION PROBLEMS
Richard J. Walalce Nic Wilson

CONFLICT-DIRECTED A* SEARCH FOR SOFT CONSTRAINTS
Martin Sachenbacher and Brian Williams

EVENT-DRIVEN PROBABILISTIC CONSTRAINT PROGRAMMING
S. Armagan Tarim, Brahim Hnich, and Steven D. Prestwich

EXPECTED-CASE ANALYSIS FOR DELAYED FILTERING
Irit Katriel

IMPROVED ALGORITHM FOR THE SOFT GLOBAL CARDINALITY CONSTRAINT
Alessandro Zanarini, Michela Milano, and Gilles Pesant

ON THE SEPARABILITY OF SUBPROBLEMS IN BENDERS DECOMPOSITIONS
Marco Cadoli and Fabio Patrizi

ONLINE STOCHASTIC RESERVATION SYSTEMS
P. Van Hentenryck, R. Bent, Y. Vergados

OPEN CONSTRAINTS IN A CLOSED WORLD
Willem-Jan van Hoeve and Jean-Charles Regin

PLAN B: UNCERTAINTY/TIME TRADE-OFFS FOR LINEAR AND INTEGER PROGRAMMING
Claire Kenyon and Meinolf Sellmann

PROGRESSIVE SOLUTIONS: A SIMPLE BUT EFFICIENT DOMINANCE RULE FOR
PRACTICAL RCPSP
Andras Kovacs and Jozsef Vancza

THE POWER OF SEMIDEFINITE PROGRAMMING RELAXATIONS FOR MAX-SAT
Carla Gomes, Willem Jan van Hoeve and Lucian Leahu

THE RANGE CONSTRAINT: ALGORITHMS AND IMPLEMENTATION
Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan,
Toby Walsh

THE TIMETABLE CONSTRAINED DISTANCE MINIMIZATION PROBLEM
Rasmus V. Rasmussen, Michael A. Trick

TRAVELING TOURNAMENT SCHEDULING: A SYSTEMATIC EVALUATION OF SIMULATED
ANNEALLING
Y. Vergados and P. Van Hentenryck

UNDIRECTED FOREST CONSTRAINTS
Nicolas Beldiceanu, Irit Katriel and Xavier Lorca

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.