2. CPAIOR 2005: Prague, Czech Republic

Invited Papers

• Thomas Bousonville, Filippo Focacci, Claude Le Pape, Wim Nuijten, Frederic Paulin, Jean-Francois Puget, Anna Robert, Alireza Sadeghin:
  Integration of Rules and Optimization in Plant PowerOps. 1-15
  
• Paul Pop:
  Embedded Systems Design: Optimization Challenges. 16-16
  
• H. P. Williams:
  Models for Solving the Travelling Salesman Problem. 17-18
  

Technical Papers

• Magnus Ågren, Pierre Flener, Justin Pearson:
  Set Variables and Local Search. 19-33
  
• Mark Bartlett, Alan M. Frisch, Youssef Hamadi, Ian Miguel, Armagan Tarim, Chris Unsworth:
  The Temporal Knapsack Problem and Its Solution. 34-48
  
• Andreas Bauer:
  Simplifying Diagnosis Using LSAT: A Propositional Approach to Reasoning from First Principles. 49-63
  
• Nicolas Beldiceanu, Pierre Flener, Xavier Lorca:
  The tree Constraint. 64-78
  
• Christian Bessière, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan, Toby Walsh:
  Filtering Algorithms for the NValue Constraint. 79-93
  
• Hadrien Cambazard, Narendra Jussien:
  Identifying and Exploiting Problem Structures Using Explanation-Based Constraint Programming. 94-109
  
• Yingyi Chu, Quanshi Xia:
  A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems. 110-124
  
• Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi:
  On the Minimal Steiner Tree Subproblem and Its Application in Branch-and-Price. 125-139
  
• Sophie Demassey, Gilles Pesant, Louis-Martin Rousseau:
  Constraint Programming Based Column Generation for Employee Timetabling. 140-154
  
• Iván Dotú, Pascal Van Hentenryck:
  Scheduling Social Golfers Locally. 155-167
  
• Khaled M. Elbassioni, Irit Katriel:
  Multiconsistency and Robustness with Global Constraints. 168-182
  
• Jeremy Frank, Elif Kürklü:
  Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations. 183-200
  
• Thorsten Gellermann, Meinolf Sellmann, Robert Wright:
  Shorter Path Constraints for the Resource Constrained Shortest Path Problem. 201-216
  
• Bernard Gendron, Hocine Lebbah, Gilles Pesant:
  Improving the Cooperation Between the Master Problem and the Subproblem in Constraint Programming Based Column Generation. 217-227
  
• Jesper Hansen, Tomas Lidén:
  Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch and Price. 228-242
  
• John N. Hooker:
  A Search-Infer-and-Relax Framework for Integrating Solution Methods. 243-257
  
• Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih:
  Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs. 258-272
  
• Steven David Prestwich, Andrea Roli:
  Symmetry Breaking and Local Search Spaces. 273-287
  
• Jean-Charles Régin:
  Combination of Among and Cardinality Constraints. 288-303
  
• T. K. Satish Kumar:
  On the Tractability of Smooth Constraint Satisfaction Problems. 304-319
  
• Hossein M. Sheini, Karem A. Sakallah:
  A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems. 320-335
  
• Barbara M. Smith:
  Symmetry and Search in a Network Design Problem. 336-350
  
• Sathiamoorthy Subbarayan:
  Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems. 351-365
  
• Michael A. Trick:
  Formulations and Reformulations in Integer Programming. 366-379
  
• Pascal Van Hentenryck, Laurent Michel:
  Nondeterministic Control for Hybrid Search. 380-395
  
• Petr Vilím:
  Computing Explanations for the Unary Resource Constraint. 396-409