CP-AI-OR 2005 May 29 - June 1, 2005. Prague, Czech Republic
International Conference on Integration of AI and OR Techniques
in Constraint Programming for Combinatorial Optimization Problems

Welcome | Master Class| Submissions | Registration | Program | Travel | Accommodation | Venue

Conference Program

SUNDAY 29th May, 2005
8.30 - 18.00 registration
9.25 - 17.30 MASTER CLASS
MONDAY 30th May, 2005
8.30 - 18.00 registration
9.25 - 9.30 Welcome and opening remarks
9.30 - 10.30
Models for Solving the Travelling Salesman Problem
H. P. Williams [abstract&bio]
Chair: Michela Milano
10.30 - 11.00 coffee break
11.10 - 13.00
Technical session: GLOBAL CONSTRAINTS
Chair: Gilles Pesant
  • The Tree Constraint
    Nicolas Beldiceanu, Pierre Flener, Xavier Lorca
  • Filtering Algorithms for the NValue Constraint
    Christian Bessiere, Emmanuel Hebrard, Brahim Hnich, Zeynep Kiziltan and Toby Walsh
  • Shorter Path Constraints for the Resource Constrained Shortest Path Problem
    Thorsten Gellermann, Meinolf Sellmann, Robert Wright
  • Combination of Among and Cardinality Constraints
    Jean-Charles Regin
13.00 - 14.30 lunch break
15.00 - 16.00
Technical session: GLOBAL CONSTRAINTS
Chair: François Laburthe
  • Multiconsistency and Robustness with Global Constraints
    Khaled Elbassioni and Irit Katriel
  • Combining Arc-Consistency and Dual Lagrangean Relaxation for Filtering CSPs
    Mohand Ou Idir Khemmoudj, Hachemi Bennaceur, Anass Nagih
  • On the Tractability of Smooth Constraint Satisfaction Problems
    T. K. Satish Kumar
16.00 - 16.30 coffee break
16.30 - 18.00
Technical session: EXPLANATIONS
Chair: Roman Barták
  • Computing Explanations for the Unary Resource Constraint
    Petr Vilím
  • Identifying and Exploiting Problem Structures Using Explanation-based Constraint Programming
    Hadrien Cambazard, Narendra Jussien
  • Integrating CSP Decomposition Techniques and BDDs for Compiling Configuration Problems
    Sathiamoorthy Subbarayan
18.30 - 21.00 welcome reception [more]
TUESDAY 31st May, 2005
8.30 - 16.15 registration
9.30 - 10.30
Embedded Systems Design: Optimizations Challenges
Paul Pop [abstract&bio]
Chair: Michela Milano
10.30 - 11.00 coffee break
11.00 - 13.00
Technical session: APPLICATIONS
Chair: François Laburthe
  • Mixed Discrete and Continuous Algorithms for Scheduling Airborne Astronomy Observations
    Jeremy Frank and Elif Kurklu
  • A Hybrid Algorithm for a Class of Resource Constrained Scheduling Problems
    Yingyi Chu and Quanshi Xia
  • The Temporal Knapsack Problem and its Solution
    Mark Bartlett, Alan M Frisch, Youssef Hamadi, Ian Miguel, S. Armagan Tarim, Chris Unsworth
  • Scheduling Social Golfers Locally
    Ivan Dotu and Pascal Van Hentenryck
13.00 - 13.10 Invitation to CPAIOR 2006
13.10 - 14.30 lunch break
14.30 - 16.30
Technical session: SEARCH AND SYMMETRIES
Chair: Meinolf Sellmann
  • Nondeterministic Control for Hybrid Search
    Pascal Van Hentenryck and Laurent Michel
  • Set Variables and Local Search
    Magnus Agren, Pierre Flener, Justin Pearson
  • Symmetry Breaking and Local Search Spaces
    Steven Prestwich and Andrea Roli
  • Symmetry and Search in a Network Design Problem
    Barbara M. Smith
16.45 - 22.00 guided tour and conference dinner [more]
WEDNESDAY 1st June, 2005
9.30 - 10.30
Integration of Rules and Optimization in Plant PowerOps
Filippo Focacci [abstract&bio]
Chair: Roman Barták
10.30 - 11.00 coffee break
11.00 - 13.00
Chair: Michael Trick
  • On the Minimal Steiner Tree Subproblem and its Application in Branch-and-Price
    Wilhelm Cronholm, Farid Ajili, Sofia Panagiotidi
  • Constraint Programming based Column Generation for Employee Timetabling
    Sophie Demassey, Gilles Pesant and Louis-Martin Rousseau
  • Improving the Cooperation Between the Master Problem and the Subproblem in CP Based Column Generation
    Bernard Gendron, Hocine Lebbah, Gilles Pesant
  • Group Construction for Airline Cabin Crew: Comparing Constraint Programming with Branch & Price
    Jesper Hansen, Tomas Lidén
13.00 - 14.30 lunch break
14.30 - 16.30
Technical session: IP and SAT
Chair: Steve Prestwich
  • Formulations and Reformulations for Integer Programming
    Michael Trick
  • A Search-Infer-and-Relax Framework for Integrating Solution Methods
    John Hooker
  • Simplifying Diagnosis using LSAT: A Propositional Approach to Reasoning from First Principles
    Andreas Bauer
  • A SAT-based Decision Procedure for Mixed Logical Linear Problems
    Hossein M. Sheini, Karem A. Sakallah

Your questions and comments might be addressed to cpaior05 (AT) cpaior05.mff.cuni.cz.


Roman Bartak, Charles University, Czech Republic
Michela Milano, Universita di Bologna, Italy


Abderrahmane Aggoun, Cosytec, France
Philippe Baptiste, Ecole Polytechnique, France

Roman Bartak, Charles University, Czech Republic
Chris Beck, University of Toronto, Canada
ats Carlsson, SICS, Sweden
Ondřej Čepek, Charles University, Czech Republic
Hani El Sakkout, CISCO, UK
Bernard Gendron, CRT and Univ. of Montreal, Canada
Carmen Gervet, IC-Parc, UK
Carla Gomes, Cornell University, USA
John Hooker, Carnegie Mellon University, USA
Narendra Jussien, Ecole des Mines de Nantes, France
Stefan Karisch, Carmen Systems, Canada
Francois Laburthe, Bouygues, France
Andrea Lodi, Univ. of Bologna, Italy
Michela Milano, Univ. of Bologna, Italy
George Nemhauser, Univ. of Georgia Tech, USA
Gilles Pesant, CRT and Ecole Polytechnique de Montreal, Canada
Jean-Francois Puget, ILOG, France
Jean-Charles Regin, Cornell University, USA
Michel Rueher, Univ. of Nice-Sophia Antipolis, France
Meinolf Sellmann, Brown University, USA
Helmut Simonis, IC-Parc, UK
Gilles Trombettoni, Univ. of Nice-Sophia Antipolis, France
Michael Trick, Carnegie Mellon University, USA
Pascal van Hentenryck, Brown University, USA
Mark Wallace, Monash University, Australia
Weixiong Zhang, Washington University, USA


Charles University, Czech Republic
Action M Agency, Czech Republic