The 2nd International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR2005)washeldinPrague,CzechRepublic,duringMay31–June1,2005. The conference is intended primarily as a forum to focus on the integration and hybridization of the approaches of constraint programming (CP), arti?cial intelligence (AI), and operations research (OR) technologies for solving large-scale and complex real-life optimization problems. Therefore, CPAIOR is never far from industrial applications. The high number of submissions received this year, almost 100 papers, in witness to the interest of the research community in this conference. From these submissions, we chose 26 to be published in full in the proceedings. This volume includes summaries of the invited talks of CPAIOR: one from industry, one from the embedded system research community, and one from the operations research community. The invited speakers were: Filippo Focacci from ILOGS.A.,France,oneoftheleadingcompaniesinthe?eld;PaulPop,professor in the Embedded Systems Lab in the Computer and Information Science - partment, Link¨ oping University; and Paul Williams, full professor of Operations Research at the London School of Economics. The day before CPAIOR, a Master Class was organized by Gilles Pesant, where leading researchers gave introductory and overview talks in the area of metaheuristics and constraint programming. The Master Class was intended for PhD students, researchers, and practitioners. We are very grateful to Gilles who brought this excellent program together. For conference publicity we warmly thank Willem Jan van Hoeve and Petr Vil´ ?m who did a great job with the high number of submissions received.
Author(s): Thomas Bousonville, Filippo Focacci, Claude Le Pape, Wim Nuijten, Frederic Paulin (auth.), Roman Barták, Michela Milano (eds.)
Series: Lecture Notes in Computer Science 3524 : Theoretical Computer Science and General Issues
Edition: 1
Publisher: Springer-Verlag Berlin Heidelberg
Year: 2005
Language: English
Pages: 412
Tags: Numeric Computing; Discrete Mathematics in Computer Science; Computer Communication Networks; Artificial Intelligence (incl. Robotics); Computer Appl. in Administrative Data Processing
Front Matter....Pages -
Integration of Rules and Optimization in Plant PowerOps....Pages 1-15
Embedded Systems Design: Optimization Challenges....Pages 16-16
Models for Solving the Travelling Salesman Problem....Pages 17-18
Set Variables and Local Search....Pages 19-33
The Temporal Knapsack Problem and Its Solution....Pages 34-48
Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles....Pages 49-63
The tree Constraint....Pages 64-78
Filtering Algorithms for the NValue Constraint....Pages 79-93
Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming....Pages 94-109
A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems....Pages 110-124
On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price....Pages 125-139
Constraint Programming Based Column Generation for Employee Timetabling....Pages 140-154
Scheduling Social Golfers Locally....Pages 155-167
Multiconsistency and Robustness with Global Constraints....Pages 168-182
Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations....Pages 183-200
Shorter Path Constraints for the Resource Constrained Shortest Path Problem....Pages 201-216
Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation....Pages 217-227
Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price....Pages 228-242
A Search-Infer-and-Relax Framework for Integrating Solution Methods....Pages 243-257
Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs....Pages 258-272
Symmetry Breaking and Local Search Spaces....Pages 273-287
Combination of Among and Cardinality Constraints....Pages 288-303
On the Tractability of Smooth Constraint Satisfaction Problems....Pages 304-319
A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems....Pages 320-335
Symmetry and Search in a Network Design Problem....Pages 336-350
Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems....Pages 351-365
Formulations and Reformulations in Integer Programming....Pages 366-379
Nondeterministic Control for Hybrid Search....Pages 380-395
Computing Explanations for the Unary Resource Constraint....Pages 396-409
Back Matter....Pages -
