This book constitutes the refereed proceedings of the Third International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2006, held in Cork, Ireland in May/June 2006.
The 20 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 67 submissions. The papers address methodological and foundational issues from AI, OR, and algorithmics and present applications to the solution of combinatorial optimization problems in various fields via constraint programming.
Author(s): Robert Bosch (auth.), J. Christopher Beck, Barbara M. Smith (eds.)
Series: Lecture Notes in Computer Science 3990 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2006
Language: English
Pages: 301
Tags: Numeric Computing; Discrete Mathematics in Computer Science; Algorithm Analysis and Problem Complexity; Artificial Intelligence (incl. Robotics); Operations Research/Decision Theory; Combinatorics
Front Matter....Pages -
Opt Art....Pages 1-1
Planning for Mixed Discrete Continuous Domains....Pages 2-2
Duality in Optimization and Constraint Satisfaction....Pages 3-15
A Totally Unimodular Description of the Consistent Value Polytope for Binary Constraint Programming....Pages 16-28
Undirected Forest Constraints....Pages 29-43
Allocation, Scheduling and Voltage Scaling on Energy Aware MPSoCs....Pages 44-58
The Range Constraint: Algorithms and Implementation....Pages 59-73
On the Separability of Subproblems in Benders Decompositions....Pages 74-88
A Hybrid Column Generation and Constraint Programming Optimizer for the Tail Assignment Problem....Pages 89-103
The Power of Semidefinite Programming Relaxations for MAX-SAT....Pages 104-118
Expected-Case Analysis for Delayed Filtering....Pages 119-125
Plan B: Uncertainty/Time Trade-Offs for Linear and Integer Programming....Pages 126-138
Progressive Solutions: A Simple but Efficient Dominance Rule for Practical RCPSP....Pages 139-151
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems....Pages 152-166
The Timetable Constrained Distance Minimization Problem....Pages 167-181
Conflict-Directed A* Search for Soft Constraints....Pages 182-196
Event-Driven Probabilistic Constraint Programming....Pages 197-211
Online Stochastic Reservation Systems....Pages 212-227
Traveling Tournament Scheduling: A Systematic Evaluation of Simulated Annealling....Pages 228-243
Open Constraints in a Closed World....Pages 244-257
Conditional Lexicographic Orders in Constraint Satisfaction Problems....Pages 258-272
An Efficient Hybrid Strategy for Temporal Planning....Pages 273-287
Improved Algorithm for the Soft Global Cardinality Constraint....Pages 288-299
Back Matter....Pages -
