1. CPAIOR 2004: Nice, France

• Christos T. Maravelias, Ignacio E. Grossmann:
  Using MILP and CP for the Scheduling of Batch Chemical Processes. 1-20
  
• Ionut D. Aron, John N. Hooker, Tallys H. Yunes:
  SIMPL: A System for Integrating Optimization Techniques. 21-36
  
• Christian Artigues, Sana Belmokhtar, Dominique Feillet:
  A New Exact Solution Algorithm for the Job Shop Problem with Sequence-Dependent Setup Times. 37-49
  
• J. Christopher Beck, Eugene C. Freuder:
  Simple Rules for Low-Knowledge Algorithm Selection. 50-64
  
• Nicolas Beldiceanu, Irit Katriel, Sven Thiel:
  Filtering Algorithms for the Same Constraint. 65-79
  
• Nicolas Beldiceanu, Thierry Petit:
  Cost Evaluation of Soft Global Constraints. 80-95
  
• Alberto Bemporad, Nicolò Giorgetti:
  SAT-Based Branch & Bound and Optimal Control of Hybrid Dynamical Systems. 96-111
  
• Thomas Bourdeaud'huy, Saïd Hanafi, Pascal Yim:
  Solving the Petri Nets Reachability Problem Using the Logical Abstraction Technique and Mathematical Programming. 112-126
  
• Yingyi Chu, Quanshi Xia:
  Generating Benders Cuts for a General Class of Integer Programming Problems. 127-141
  
• Mattias Grönkvist:
  A Constraint Programming Model for Tail Assignment. 142-156
  
• Emmanuel Hebrard, Brahim Hnich, Toby Walsh:
  Super Solutions in Constraint Programming. 157-172
  
• Olli Kamarainen, Hani El Sakkout:
  Local Probing Applied to Network Routing. 173-189
  
• Irit Katriel:
  Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights. 190-199
  
• Waldemar Kocjan, Per Kreuger:
  Filtering Methods for Symmetric Cardinality Constraint. 200-208
  
• Olivier Lhomme:
  Arc-Consistency Filtering Algorithms for Logical Combinations of Constraints. 209-224
  
• Laurent Perron, Paul Shaw:
  Combining Forces to Solve the Car Sequencing Problem. 225-239
  
• Cédric Pralet, Gérard Verfaillie:
  Travelling in the World of Local Searches in the Space of Partial Assignments. 240-255
  
• Cristina Ribeiro, Maria Antónia Carravilla:
  A Global Constraint for Nesting Problems. 256-270
  
• Barbara M. Smith, Karen E. Petrie, Ian P. Gent:
  Models and Symmetry Breaking for 'Peaceable Armies of Queens'. 271-286
  
• Sébastien Sorlin, Christine Solnon:
  A Global Constraint for Graph Isomorphism Problems. 287-302
  
• Armagan Tarim, Ian Miguel:
  Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem. 302-318
  
• Pascal Van Hentenryck, Laurent Michel:
  Scheduling Abstractions for Local Search. 319-334
  
• Petr Vilím:
  O(n log n) Filtering Algorithms for Unary Resource Constraint. 335-347
  
• Quanshi Xia, Andrew Eremin, Mark Wallace:
  Problem Decomposition for Traffic Diversions. 348-363
  
• Gautam Appa, Dimitris Magos, Ioannis Mourtos:
  LP Relaxations of Multiple all_different Predicates. 364-369
  
• Ayoub Insa Corréa, André Langevin, Louis-Martin Rousseau:
  Dispatching and Conflict-Free Routing of Automated Guided Vehicles: A Hybrid Approach Combining Constraint Programming and Mixed Integer Programming. 370-379
  
• Cormac Gebruers, Alessio Guerri, Brahim Hnich, Michela Milano:
  Making Choices Using Structure at the Instance Level within a Case Based Reasoning Framework. 380-386
  
• Carla P. Gomes, Meinolf Sellmann, Cindy van Es, Harold van Es:
  The Challenge of Generating Spatially Balanced Scientific Experiment Designs. 387-394
  
• Gerrit Renker, Hatem Ahriz:
  Building Models through Formal Specification. 395-401
  
• Louis-Martin Rousseau:
  Stabilization Issues for Constraint Programming Based Column Generation. 402-408
  
• Ruslan Sadykov:
  A Hybrid Branch-And-Cut Algorithm for the One-Machine Scheduling Problem. 409-415
  

Last update Mon Feb 13 04:22:18 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page