CP-AI-OR'04: Program

Program

We are gratefull to the authors who gave us access to the material used for their invited talk. However, please, note that this material is the property of their authors and that any reuse of this material, or of any part of this material should be properly referenced.

Tuesday 20th

8h30-9h45:

Registration

9h45-10h00:

Welcome Talk

10h00-11h00:

Invited Talk

	On Strengthened Relaxations for some CP-Resistant Combinatorial Problems and their Potential Usefulness
	Michel Minoux, Universite P. et M. Curie-CNRS

11h00-11h15:

Break

11h15-12h05:

Session 1: Global Constraints I

	Dynamic Heaviest Paths in DAGs with Arbitrary Edge Weights
	Irit Katriel

	A global constraint for graph isomorphism problems
	Sébastien Sorlin and Christine Solnon

12h05-14h00:

Lunch

14h00-15h40:

Session 2: Applications I

	Diversions with Hybrid Algorithms
	Quanshi Xia, Andrew Eremin and Mark Wallace

	Dispatching and conflict-free routing of automated guided vehicles: A hybrid approach combining Constraint Programming and Mixed Integer Programming
	Ayoub Insa Corréa, André Langevin and Louis Martin Rousseau

	Echelon Stock Formulation of Arborescent Distribution Systems: An Application to the Wagner-Whitin Problem
	S. Armagan Tarim and Ian Miguel

	SAT-based Branch & Bound and Optimal Control of Hybrid Systems
	Alberto Bemporad and Nicolo' Giorgetti

15h40-16h10:

Break

16h10-17h50:

Session 3: Local Search

	Travelling in the World of Local Searches in the Space of Partial Assignments
	Cédric Pralet and Gérard Verfaillie

	Scheduling Abstractions for Local Search
	Pascal Van Hentenryck and Laurent Michel

	Local Probing Applied to Network Routing
	Olli Kamarainen and Hani El Sakkout

	Combining Forces To Solve The Car Sequencing Problem
	Laurent Perron and Paul Shaw

Wednesday 21th

9h00-10h00:

Invited Talk

	Using MILP and CP for the Scheduling of Batch Chemical Processes
	Ignacio Grossmann and Christos T. Maravelias, Carnegie Mellon University

10h00-10h20:

Break

10h20-12h00:

Session 4: Constraint Techniques

	Super Solutions in Constraint Programming
	Emmanuel Hebrard, Brahim Hnich and Toby Walsh

	Models and Symmetry Breaking for `Peaceable Armies of Queens'
	Barbara M. Smith, Karen E. Petrie and Ian P. Gent

	Cost Evaluation of Soft Global Constraints
	Nicolas Beldiceanu and Thierry Petit

	Arc-consistency Filtering Algorithms for Logical Combinations of Constraints
	Olivier Lhomme

12h00-13h30:

Lunch

13h30-14h45:

Session 5: Scheduling

	A Hybrid Branch-and-Cut Algorithm for the One-Machine Scheduling Problem
	Ruslan Sadykov

	O(n log n) Filtering Algorithms for Unary Resource Constraint
	Petr Vilim

	A new exact algorithm for the Job Shop Problem with Setup Times
	Christian Artigues, Sana Belmokhtar and Dominique Feillet

14h45-15h00:

Break

15h00-16h15:

Session 6: Integer Programming

	LP relaxations of multiple all_different predicates
	G.Appa, D.Magos and I.Mourtos

	Generating Benders Cuts for a General Class of Integer Programming Problems
	Yingyi Chu and Quanshi Xia

	Stabilization Issues for Constraint Programming Based Column Generation
	Louis-Martin Rousseau

Banquet

Thursday 22th

9h00-10h00:

Invited Talk

	Mastering the challenges of optimization problems in Supply Chain Management
	Heinrich Braun and Thomas Kasper, SAP AG

10h00-10h20:

Break

10h20-12h00:

Session 7: Applications II

	Solving reachability problem in Petri nets using the logical abstraction technique and mathematical programming
	T. Bourdeaud'huy, S. Hanafi and P. Yim

	Building models through formal specification
	Gerrit Renker and Hatem Ahriz

	A Constraint Programming Model for Tail Assignment
	Mattias Grönkvist

	The Challenge of Generating Spatially Balanced Scientific Experiment Designs
	Carla Gomes, Meinolf Sellmann, Cindy van Es and Harold van Es

12h00-13h45:

Lunch

13h45-14h00:

CP-AI-OR'05

14h00-15h15:

Session 8: Systems

	Simple Rules for Low-Knowledge Algorithm Selection
	J. Christopher Beck and Eugene C. Freuder

	Making Choices using Structure at the Instance Level within a Case Based Reasoning Framework
	C. Gebruers, A. Guerri, B. Hnich and M. Milano

	SIMPL: A System for Integrating Optimization Techniques
	Ionut Aron, John N. Hooker and Tallys H. Yunes

15h15-15h45:

Break

15h45-17h00:

Session 9: Global Constraints II

	Filtering algorithms for the Same and UsedBy constraints
	Nicolas Beldiceanu, Irit Katriel and Sven Thiel

	Filtering Methods for Symmetric Cardinality Constraint
	Waldemar Kocjan and Per Kreuger

	A Global Constraint for Nesting Problems
	Cristina Ribeiro and Maria Antónia Carravilla