3. CPAIOR 2006: Cork, Ireland

J. Christopher Beck, Barbara M. Smith (Eds.): Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Third International Conference, CPAIOR 2006, Cork, Ireland, May 31 - June 2, 2006, Proceedings. Lecture Notes in Computer Science 3990 Springer 2006, ISBN 3-540-34306-7 BibTeX

Invited Talk

Robert Bosch:
Opt Art. 1
Electronic Edition (link) BibTeX
Maria Fox:
Planning for Mixed Discrete Continuous Domains. 2
Electronic Edition (link) BibTeX
John N. Hooker:
Duality in Optimization and Constraint Satisfaction. 3-15
Electronic Edition (link) BibTeX

Technical Papers

Ionut D. Aron, Daniel H. Leventhal, Meinolf Sellmann:
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming. 16-28
Electronic Edition (link) BibTeX
Nicolas Beldiceanu, Irit Katriel, Xavier Lorca:
Undirected Forest Constraints. 29-43
Electronic Edition (link) BibTeX
Luca Benini, Davide Bertozzi, Alessio Guerri, Michela Milano:
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs. 44-58
Electronic Edition (link) BibTeX
Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
The Range Constraint: Algorithms and Implementation. 59-73
Electronic Edition (link) BibTeX
Marco Cadoli, Fabio Patrizi:
On the Separability of Subproblems in Benders Decompositions. 74-88
Electronic Edition (link) BibTeX
Sami Gabteni, Mattias Grönkvist:
A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem. 89-103
Electronic Edition (link) BibTeX
Carla P. Gomes, Willem Jan van Hoeve, Lucian Leahu:
The Power of Semidefinite Programming Relaxations for MAX-SAT. 104-118
Electronic Edition (link) BibTeX
Irit Katriel:
Expected-Case Analysis for Delayed Filtering. 119-125
Electronic Edition (link) BibTeX
Claire Kenyon, Meinolf Sellmann:
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming. 126-138
Electronic Edition (link) BibTeX
András Kovács, József Váncza:
Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP. 139-151
Electronic Edition (link) BibTeX
Radu Marinescu, Rina Dechter:
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems. 152-166
Electronic Edition (link) BibTeX
Rasmus V. Rasmussen, Michael A. Trick:
The Timetable Constrained Distance Minimization Problem. 167-181
Electronic Edition (link) BibTeX
Martin Sachenbacher, Brian C. Williams:
Conflict-Directed A* Search for Soft Constraints. 182-196
Electronic Edition (link) BibTeX
Armagan Tarim, Brahim Hnich, Steven David Prestwich:
Event-Driven Probabilistic Constraint Programming. 197-211
Electronic Edition (link) BibTeX
Pascal Van Hentenryck, Russell Bent, Yannis Vergados:
Online Stochastic Reservation Systems. 212-227
Electronic Edition (link) BibTeX
Pascal Van Hentenryck, Yannis Vergados:
Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling. 228-243
Electronic Edition (link) BibTeX
Willem Jan van Hoeve, Jean-Charles Régin:
Open Constraints in a Closed World. 244-257
Electronic Edition (link) BibTeX
Richard J. Wallace, Nic Wilson:
Conditional Lexicographic Orders in Constraint Satisfaction Problems. 258-272
Electronic Edition (link) BibTeX
Zhao Xing, Yixin Chen, Weixiong Zhang:
An Efficient Hybrid Strategy for Temporal Planning. 273-287
Electronic Edition (link) BibTeX
Alessandro Zanarini, Michela Milano, Gilles Pesant:
Improved Algorithm for the Soft Global Cardinality Constraint. 288-299
Electronic Edition (link) BibTeX