15. CP 2009: Lisbon, Portugal

Invited Talks

• Philippe Baptiste:
  Constraint-Based Schedulers, Do They Really Work? 1
  
• Carla P. Gomes:
  Challenges for Constraint Reasoning and Optimization in Computational Sustainability. 2-4
  
• Barbara M. Smith:
  Observations on Symmetry Breaking. 5
  

Application Track Papers

• Alberto Delgado, Rune Møller Jensen, Christian Schulte:
  Generating Optimal Stowage Plans for Container Vessel Bays. 6-20
  
• Iván Dotú, Pascal Van Hentenryck, Miguel A. Patricio, Antonio Berlanga, José García, José M. Molina López:
  Real-Time Tabu Search for Video Tracking Association. 21-34
  
• Bella Dubrov, Haggai Eran, Ari Freund, Edward F. Mark, Shyam Ramji, Timothy A. Schell:
  Pin Assignment Using Stochastic Local Search Constraint Programming. 35-49
  
• Sophie Huczynska, Paul McKay, Ian Miguel, Peter Nightingale:
  Modelling Equidistant Frequency Permutation Arrays: An Application of Constraints to Mathematics. 50-64
  
• Andrew Loewenstern:
  Scheduling the CB1000 Nanoproteomic Analysis System with Python, Tailor, and Minion. 65-72
  
• Jean-Philippe Métivier, Patrice Boizumault, Samir Loudni:
  Solving Nurse Rostering Problems Using Soft Global Constraints. 73-87
  
• Laurent Michel, Martijn Moraal, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck:
  Online Selection of Quorum Systems for RAMBO Reconfiguration. 88-103
  
• Helmut Simonis:
  A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem. 104-118
  

Research Track Papers

• Magnus Ågren:
  Memoisation for Constraint-Based Local Search. 119-126
  
• Carlos Ansótegui, Maria Luisa Bonet, Jordi Levy:
  On the Structure of Industrial SAT Instances. 127-141
  
• Carlos Ansótegui, Meinolf Sellmann, Kevin Tierney:
  A Gender-Based Genetic Algorithm for the Automatic Configuration of Algorithms. 142-157
  
• Ignacio Araya, Gilles Trombettoni, Bertrand Neveu:
  Filtering Numerical CSPs Using Well-Constrained Subsystems. 158-172
  
• Christian Bessiere, Emmanuel Hebrard, Barry O'Sullivan:
  Minimising Decision Tree Size as Combinatorial Optimisation. 173-187
  
• Gilles Chabert, Luc Jaulin:
  Hull Consistency under Monotonicity. 188-195
  
• Gilles Chabert, Luc Jaulin, Xavier Lorca:
  A Constraint on the Number of Distinct Vectors with Application to Localization. 196-210
  
• Arthur Choi, Trevor Standley, Adnan Darwiche:
  Approximating Weighted Max-SAT Problems by Compensating for Relaxations. 211-225
  
• Geoffrey Chu, Christian Schulte, Peter J. Stuckey:
  Confidence-Based Work Stealing in Parallel Constraint Programming. 226-241
  
• Geoffrey Chu, Peter J. Stuckey:
  Minimizing the Maximum Number of Open Stacks by Customer Search. 242-257
  
• Geoffrey Chu, Peter J. Stuckey, Maria Garcia de la Banda:
  Using Relaxations in Maximum Density Still Life. 258-273
  
• Vianney le Clément de Saint-Marcq, Yves Deville, Christine Solnon:
  Constraint-Based Graph Matching. 274-288
  
• David A. Cohen, Martin J. Green, Chris Houghton:
  Constraint Representations and Structural Tractability. 289-303
  
• Redouane Ezzahir, Christian Bessiere, Mohamed Wahbi, Imade Benelallam, Houssine Bouyakhf:
  Asynchronous Inter-Level Forward-Checking for DisCSPs. 304-318
  
• François Fages, Aurélien Rizk:
  From Model-Checking to Temporal Logic Constraint Solving. 319-334
  
• Aurélie Favier, Simon de Givry, Philippe Jégou:
  Exploiting Problem Structure for Solution Counting. 335-343
  
• Mohammad M. Fazel-Zarandi, J. Christopher Beck:
  Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition. 344-351
  
• Thibaut Feydy, Peter J. Stuckey:
  Lazy Clause Generation Reengineered. 352-366
  
• Alan M. Frisch, Peter J. Stuckey:
  The Proper Treatment of Undefinedness in Constraint Languages. 367-382
  
• Alex S. Fukunaga:
  Search Spaces for Min-Perturbation Repair. 383-390
  
• Andrew Grayland, Ian Miguel, Colva M. Roney-Dougal:
  Snake Lex: An Alternative to Double Lex. 391-399
  
• Diarmuid Grimes, Emmanuel Hebrard, Arnaud Malapert:
  Closing the Open Shop: Contradicting Conventional Wisdom. 400-408
  
• Tarik Hadzic, Alan Holland, Barry O'Sullivan:
  Reasoning about Optimal Collections of Solutions. 409-423
  
• Emmanuel Hebrard, Dániel Marx, Barry O'Sullivan, Igor Razgon:
  Constraints of Difference and Equality: A Complete Taxonomic Characterisation. 424-438
  
• Brahim Hnich, Roberto Rossi, S. Armagan Tarim, Steven David Prestwich:
  Synthesizing Filtering Algorithms for Global Chance-Constraints. 439-453
  
• Joxan Jaffar, Andrew E. Santosa, Razvan Voicu:
  An Interpolation Method for CLP Traversal. 454-469
  
• Christopher Jefferson, Serdar Kadioglu, Karen E. Petrie, Meinolf Sellmann, Stanislav Zivny:
  Same-Relation Constraints. 470-485
  
• Serdar Kadioglu, Meinolf Sellmann:
  Dialectic Search. 486-500
  
• George Katsirelos, Sebastian Maneth, Nina Narodytska, Toby Walsh:
  Restricted Global Grammar Constraints. 501-508
  
• Konstantin Korovin, Nestan Tsiskaridze, Andrei Voronkov:
  Conflict Resolution. 509-523
  
• Mikael Z. Lagerkvist, Christian Schulte:
  Propagator Groups. 524-538
  
• Ronan LeBras, Alessandro Zanarini, Gilles Pesant:
  Efficient Generic Search Heuristics within the EMBP Framework. 539-553
  
• Christophe Lecoutre, Olivier Roussel:
  Failed Value Consistencies for Constraint Satisfaction. 554-568
  
• Michele Lombardi, Michela Milano:
  A Precedence Constraint Posting Approach for the RCPSP with Time Lags and Variable Durations. 569-583
  
• Michael J. Maher:
  SOGgy Constraints: Soft Open Global Constraints. 584-591
  
• Radu Marinescu:
  Exploiting Problem Decomposition in Multi-objective Constraint Optimization. 592-607
  
• Deepak Mehta, Barry O'Sullivan, Luis Quesada, Nic Wilson:
  Search Space Extraction. 608-622
  
• Naoki Ohta, Vincent Conitzer, Ryo Ichimura, Yuko Sakurai, Atsushi Iwasaki, Makoto Yokoo:
  Coalition Structure Generation Utilizing Compact Characteristic Function Representations. 623-638
  
• Alexandre Papadopoulos, Barry O'Sullivan:
  Compiling All Possible Conflicts of a CSP. 639-653
  
• Knot Pipatsrisawat, Adnan Darwiche:
  On the Power of Clause-Learning SAT Solvers with Restarts. 654-668
  
• Cédric Pralet, Gérard Verfaillie:
  Slice Encoding for Constraint-Based Planning. 669-683
  
• Steven David Prestwich, S. Armagan Tarim, Roberto Rossi, Brahim Hnich:
  Evolving Parameterised Policies for Stochastic Constraint Programming. 684-691
  
• Raphael M. Reischuk, Christian Schulte, Peter J. Stuckey, Guido Tack:
  Maintaining State in Propagation Solvers. 692-706
  
• Yevgeny Schreiber:
  Cost-Driven Interactive CSP with Constraint Relaxation. 707-722
  
• Christian Schulte, Guido Tack:
  Weakly Monotonic Propagators. 723-730
  
• Anika Schumann, Martin Sachenbacher, Jinbo Huang:
  Constraint-Based Optimal Testing Using DNNF Graphs. 731-745
  
• Andreas Schutt, Thibaut Feydy, Peter J. Stuckey, Mark Wallace:
  Why Cumulative Decomposition Is Not as Bad as It Sounds. 746-761
  
• Meinolf Sellmann:
  On Decomposing Knapsack Constraints for Length-Lex Bounds Consistency. 762-770
  
• David Stynes, Kenneth N. Brown:
  Realtime Online Solving of Quantified CSPs. 771-786
  
• Pascal Van Hentenryck, Carleton Coffrin, Boris Gutkovich:
  Constraint-Based Local Search for the Automatic Generation of Architectural Tests. 787-801
  
• Petr Vilím:
  Edge Finding Filtering Algorithm for Discrete Cumulative Resources in O(kn log n){\mathcal O}(kn {\rm log} n). 802-816
  
• Justin Yip, Pascal Van Hentenryck:
  Evaluation of Length-Lex Set Variables. 817-832
  
• Stanislav Zivny, Peter G. Jeavons:
  The Complexity of Valued Constraint Models. 833-841
  

Last update Tue May 21 16:26:16 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page