Principles and Practice of Constraint Programming - CP 2009

1. Front Matter

   PDF

2. Invited Talks

   1. Constraint-Based Schedulers, Do They Really Work?

      • Philippe Baptiste

      Pages 1-1

   2. Challenges for Constraint Reasoning and Optimization in Computational Sustainability

      • Carla P. Gomes

      Pages 2-4

   3. Observations on Symmetry Breaking

      • Barbara M. Smith

      Pages 5-5

3. Application Track Papers

   1. Generating Optimal Stowage Plans for Container Vessel Bays

      • Alberto Delgado, Rune Møller Jensen, Christian Schulte

      Pages 6-20

   2. Real-Time Tabu Search for Video Tracking Association

      • Ivan Dotu, Pascal Van Hentenryck, Miguel A. Patricio, A. Berlanga, Jose García, Jose M. Molina

      Pages 21-34

   3. Pin Assignment Using Stochastic Local Search Constraint Programming

      • Bella Dubrov, Haggai Eran, Ari Freund, Edward F. Mark, Shyam Ramji, Timothy A. Schell

      Pages 35-49

   4. Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics

      • Sophie Huczynska, Paul McKay, Ian Miguel, Peter Nightingale

      Pages 50-64

   5. Scheduling the CB1000 Nanoproteomic Analysis System with Python, Tailor, and Minion

      • Andrew Loewenstern

      Pages 65-72

   6. Solving Nurse Rostering Problems Using Soft Global Constraints

      • Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni

      Pages 73-87

   7. Online Selection of Quorum Systems for RAMBO Reconfiguration

      • Laurent Michel, Martijn Moraal, Alexander Shvartsman, Elaine Sonderegger, Pascal Van Hentenryck

      Pages 88-103

   8. A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem

      • Helmut Simonis

      Pages 104-118

4. Research Track Papers

   1. Memoisation for Constraint-Based Local Search

      • Magnus Ågren

      Pages 119-126

   2. On the Structure of Industrial SAT Instances

      • Carlos Ansótegui, María Luisa Bonet, Jordi Levy

      Pages 127-141

   3. A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms

      • Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney

      Pages 142-157

   4. Filtering Numerical CSPs Using Well-Constrained Subsystems

      • Ignacio Araya, Gilles Trombettoni, Bertrand Neveu

      Pages 158-172

   5. Minimising Decision Tree Size as Combinatorial Optimisation

      • Christian Bessiere, Emmanuel Hebrard, Barry O’Sullivan

      Pages 173-187

   6. Hull Consistency under Monotonicity

      • Gilles Chabert, Luc Jaulin

      Pages 188-195

   7. A Constraint on the Number of Distinct Vectors with Application to Localization

      • Gilles Chabert, Luc Jaulin, Xavier Lorca

      Pages 196-210

   8. Approximating Weighted Max-SAT Problems by Compensating for Relaxations

      • Arthur Choi, Trevor Standley, Adnan Darwiche

      Pages 211-225

This volume contains the papers presented at CP 2009: The 15th International Conference on Principles and Practice of Constraint Programming. It was held from September 20–24, 2009 at the Rectory of the New University of Lisbon, Portugal. Everyone involved with the conference thanks our sponsors for their support. There were 128 submissions to the research track, of which 53 were accepted for a rate of 41.4%. Each submission was reviewed by three reviewers, with a small number of additional reviews obtained in exceptional cases. Each review waseitherbyaProgrammeCommitteemember,orbyacolleagueinvitedtohelp by a committee member thanks to their particular expertise. Papers submitted as long papers were accepted at full length or not at all. It is important to note that papers submitted as short papers were held to the same high standards of qualityas long papers. There is thus no distinction in these proceedings between long and short papers, except of course the number of pages they occupy. As it happens, the acceptancerates of short and long papers wereverysimilar indeed. Therewere13submissionstotheapplicationtrack,ofwhich8wereaccepted, fora rateof61.5%.Papersunderwentthe samereviewprocessasregularpapers, and there was not a separate committee for reviewing application track papers. However, papers in the application track were not required to be original or novel research, but to be original and novel as an application of constraints.

• CSP heuristics
• CSP solving
• Constraint
• SAT
• algorithms
• complexity
• constraint logic programming
• constraint networks
• constraint satisfaction
• distributed constraints
• genetic algorithm
• programming
• satisfiability
• temporal logic

• School of Computer Science, University of St. Andrews, Fife, Scotland, UK

  Ian P. Gent

Policies and ethics