6. CPAIOR 2009: Pittsburgh, PA, USA

Invited Talks

• Eva K. Lee:
  Machine Learning Framework for Classification in Medicine and Biology. 1-7
  
• Mark Wallace:
  G12 - Towards the Separation of Problem Modelling and Problem Solving. 8-10
  

Regular Papers

• Magnus Ågren, Nicolas Beldiceanu, Mats Carlsson, Mohamed Sbihi, Charlotte Truchet, Stéphane Zampelli:
  Six Ways of Integrating Symmetries within Non-overlapping Constraints. 11-25
  
• Alessio Bonfietti, Michele Lombardi, Michela Milano, Luca Benini:
  Throughput Constraint for Synchronous Data Flow Graphs. 26-40
  
• Hadrien Cambazard, Eoin O'Mahony, Barry O'Sullivan:
  A Shortest Path-Based Approach to the Multileaf Collimator Sequencing Problem. 41-55
  
• Bistra N. Dilkina, Carla P. Gomes, Yuri Malitsky, Ashish Sabharwal, Meinolf Sellmann:
  Backdoors to Combinatorial Optimization: Feasibility and Optimality. 56-70
  
• Martin Gebser, Benjamin Kaufmann, Torsten Schaub:
  Solution Enumeration for Projected Boolean Search Problems. 71-86
  
• Stefano Gualandi:
  k-Clustering Minimum Biclique Completion via a Hybrid CP and SDP Approach. 87-101
  
• Alexander Gutfraind, Aric A. Hagberg, Feng Pan:
  Optimal Interdiction of Unreactive Markovian Evaders. 102-116
  
• Stefan Heinz, Martin Sachenbacher:
  Using Model Counting to Find Optimal Distinguishing Tests. 117-131
  
• George Katsirelos, Nina Narodytska, Toby Walsh:
  Reformulating Global Grammar Constraints. 132-147
  
• Philippe Laborie:
  IBM ILOG CP Optimizer for Detailed Scheduling Illustrated on Three Problems. 148-162
  
• Michael J. Maher:
  Open Constraints in a Boundable World. 163-177
  
• Julien Menana, Sophie Demassey:
  Sequencing and Counting with the multicost-regular Constraint. 178-192
  
• Laurent D. Michel, Pascal Van Hentenryck, Elaine L. Sonderegger, Alexander A. Shvartsman, Martijn Moraal:
  Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services. 193-207
  
• Sylvain Mouret, Ignacio E. Grossmann, Pierre Pestiaux:
  Tightening the Linear Relaxation of a Mixed Integer Nonlinear Program Using Constraint Programming. 208-222
  
• Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann:
  The Polytope of Context-Free Grammar Constraints. 223-232
  
• Tyrel Russell, Peter van Beek:
  Determining the Number of Games Needed to Guarantee an NHL Playoff Spot. 233-247
  
• Pierre Schaus, Pascal Van Hentenryck, Jean-Charles Régin:
  Scalable Load Balancing in Nurse to Patient Assignment Problems. 248-262
  
• Efstathios Stamatatos, Kostas Stergiou:
  Learning How to Propagate Using Random Probing. 263-278
  
• David C. Uthus, Patricia J. Riddle, Hans W. Guesgen:
  DFS* and the Traveling Tournament Problem. 279-293
  
• Petr Vilím:
  Max Energy Filtering Algorithm for Discrete Cumulative Resources. 294-308
  

Extended Abstracts

• Tobias Achterberg, Timo Berthold:
  Hybrid Branching. 309-311
  
• Rodrigo Acuna-Agost, Philippe Michelon, Dominique Feillet, Serigne Gueye:
  Constraint Programming and Mixed Integer Linear Programming for Rescheduling Trains under Disrupted Operations. 312-313
  
• Roman Barták, Daniel Toropila:
  Constraint Models for Sequential Planning. 314-315
  
• Mohammad Dib, Alexandre Caminada, Hakim Mabed:
  A Fast Algorithm to Solve the Frequency Assignment Problem. 316-318
  
• Nizar El Hachemi, Michel Gendreau, Louis-Martin Rousseau:
  A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem. 319-320
  
• François Fages, Julien Martin:
  Modelling Search Strategies in Rules2CP. 321-322
  
• Jacob Feldman, Eugene C. Freuder, James Little:
  CP-INSIDE: Embedding Constraint-Based Decision Engines in Business Applications. 323-324
  
• Abdullah Konak, Sadan Kulturel-Konak:
  An Integrated Genetic Algorithm and Integer Programming Approach to the Network Design Problem with Relays. 325
  
• Benjamin Peterson, Michael A. Trick:
  A Benders'Approach to a Transportation Network Design Problem. 326-327
  
• Helmut Simonis:
  Progress on the Progressive Party Problem. 328-329