This book constitutes the refereed proceedings of the 4th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2007, held in Brussels, Belgium in May 2007.
The 27 revised full papers presented were carefully reviewed and selected from 80 submissions. Methodological and foundational issues from AI, OR, and algorithmics are presented as well as applications to the solution of combinatorial optimization problems in various fields via constraint programming.
Author(s): Davaatseren Baatar, Natashia Boland (auth.), Pascal Van Hentenryck, Laurence Wolsey (eds.)
Series: Lecture Notes in Computer Science 4510 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2007
Language: English
Pages: 391
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 -
Minimum Cardinality Matrix Decomposition into Consecutive-Ones Matrices: CP and IP Approaches....Pages 1-15
Connections in Networks: Hardness of Feasibility Versus Optimality....Pages 16-28
Modeling the Regular Constraint with Integer Programming....Pages 29-43
Hybrid Local Search for Constrained Financial Portfolio Selection Problems....Pages 44-58
The “Not-Too-Heavy Spanning Tree” Constraint....Pages 59-70
Eliminating Redundant Clauses in SAT Instances....Pages 71-83
Cost-Bounded Binary Decision Diagrams for 0-1 Programming....Pages 84-98
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs....Pages 99-111
A Global Constraint for Total Weighted Completion Time....Pages 112-126
Computing Tight Time Windows for RCPSPWET with the Primal-Dual Method....Pages 127-140
Necessary Condition for Path Partitioning Constraints....Pages 141-154
A Constraint Programming Approach to the Hospitals / Residents Problem....Pages 155-170
Best-First AND/OR Search for 0/1 Integer Programming....Pages 171-185
A Position-Based Propagator for the Open-Shop Problem....Pages 186-199
Directional Interchangeability for Enhancing CSP Solving....Pages 200-213
A Continuous Multi-resources cumulative Constraint with Positive-Negative Resource Consumption-Production....Pages 214-228
Replenishment Planning for Stochastic Inventory Systems with Shortage Cost....Pages 229-243
Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search....Pages 244-259
The Deviation Constraint....Pages 260-274
The Linear Programming Polytope of Binary Constraint Problems with Bounded Tree-Width....Pages 275-287
On Boolean Functions Encodable as a Single Linear Pseudo-Boolean Constraint....Pages 288-302
Solving a Stochastic Queueing Control Problem with Constraint Programming....Pages 303-317
Constrained Clustering Via Concavity Cuts....Pages 318-331
Bender’s Cuts Guided Large Neighborhood Search for the Traveling Umpire Problem....Pages 332-345
A Large Neighborhood Search Heuristic for Graph Coloring....Pages 346-360
Generalizations of the Global Cardinality Constraint for Hierarchical Resources....Pages 361-375
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems....Pages 376-390
Back Matter....Pages -
