PROGRAMME

Thursday May 8, 2003
08h00-08h45	Registration
08h45-09h00	Welcome and opening remarks
09h00-10h00	Invited talk: Gilles Savard, "Bilevel Programming Paradigm 
		and Application to Revenue Management and Price Setting Problems"
10h00-10h30	Break
10h30-12h00	Technical session 1
		A HYBRID CONSTRAINT PROGRAMMING AND SEMIDEFINITE PROGRAMMING
		APPROACH FOR THE STABLE SET PROBLEM 
		W.J. van Hoeve
		DISCREPANCY-BASED ADDITIVE BOUNDING
      		Andrea Lodi, Michela Milano
		DETECTING INFEASIBILITY AND GENERATING CUTS FOR MIP USING CP
     		Alexander Bockmayr, Nicolai Pisaruk
12h00-13h30	Lunch
13h30-15h00	Technical session 2
		HEURISTIC BRANCH-AND-PRICE-AND-CUT TO SOLVE A NETWORK DESIGN PROBLEM
      		Alain Chabrier
		USING CONSTRAINT PROPAGATION TO ACCELERATE COLUMN GENERATION IN
     		AIRCRAFT SCHEDULING
      		Mattias Grönkvist
		INTENSIFICATION HEURISTICS FOR MIXED INTEGER PROGRAMMING: 
		A CASE STUDY ON JOB-SHOP SCHEDULING PROBLEMS
      		Emilie Danna, Edward Rothberg and Claude Le Pape
15h00-15h15	Break
15h15-16h45	Technical session 3
		A SIMULATED ANNEALING APPROACH TO THE TRAVELING TOURNAMENT PROBLEM
      		A. Anagnostopoulos, L. Michel, P. Van Hentenryck, and Y. Vergados
		A HYBRID SETUP FOR A HYBRID SCENARIO: COMBINING HEURISTICS 
		FOR THE HOME HEALTH CARE PROBLEM
      		Stefan Bertels, Torsten Fahle
		A HYBRID MILP/CP DECOMPOSITION APPROACH FOR THE SCHEDULING OF BATCH PLANTS
      		Christos T. Maravelias Ignacio E. Grossmann
17h00-19h00	Welcome Reception

Friday May 9, 2003
09h00-10h00	Invited talk: Richard E. Korf, "Optimal Rectangle Packing"
10h00-10h30	Break
10h30-12h30	Technical session 4
		TOOLS: A LIBRARY FOR PARTIAL AND HYBRID SEARCH METHODS
      		Simon de Givry and Laurent Jeannin
		SWEEP SYNCHRONIZATION AS A GLOBAL PROPAGATION MECHANISM
      		Nicolas Beldiceanu, Mats Carlsson, Sven Thiel
		A GLOBAL CONSTRAINT FOR CUTSET PROBLEMS
      		François Fages and Akash Lal
		SOLVING THE MAXIMUM CLIQUE PROBLEM WITH CONSTRAINT PROGRAMMING
      		Jean-Charles Regin
12h30-14h00	Lunch
14h00-16h00	Technical session 5
		WHEN LOCAL SEARCH GOES WITH THE WINNERS
     		Bertrand Neveu and Gilles Trombettoni
		ON-LINE RESOURCES ALLOCATION FOR ATM NETWORKS WITH REROUTING
      		Samir Loudni, Patrice Boizumault and Philippe David
		SAFE EMBEDDING OF LP IN THE CSP FRAMEWORK
      		Claude Michel, Yahia Lebbah, Michel Rueher
		A NEW APPROACH TO SOLVE THE 2-MACHINE BICRITERIA FLOWSHOP SCHEDULING PROBLEM
      		Gaofeng Huang, Andrew Lim
16h15-17h45	Informal tour of Old Montreal and the Old Port area
18h00-18h30	Mini cruise from the Old Port to Île Sainte-Hélène
18h45-		Cocktail and Banquet 

Saturday May 10, 2003
09h00-10h00	Technical session 6
		A NEW HEURISTIC METHOD FOR THE BANDWIDTH MINIMIZATION PROBLEM
      		Andrew Lim, Brian Rodrigues, Fei Xiao
		FAST RESTART POLICIES AND LARGE NEIGHBORHOOD SEARCH
     		Laurent Perron
10h00-10h30	Break
10h30-12h30	Technical session 7
		MODELLING AND SOLVING ENGLISH PEG SOLITAIRE
      		Chris Jefferson, Angela Miguel, Ian Miguel, Armagan Tarim
		INTEGRATED PRODUCTION AND MATERIAL HANDLING SCHEDULING USING
      		MATHEMATICAL PROGRAMMING AND CONSTRAINT PROGRAMMING
      		El Khayat Ghada, Langevin André, Riopel Diane
		MULTICRITERIA SEARCH IN CONSTRAINT PROGRAMMING
      		F. Le Huédé, M. Grabisch, C. Labreuche, P. Savéant
		PROBLEM STRUCTURE AND SEARCH: EMPIRICAL RESULTS AND OPEN QUESTIONS
      		Andrea Roli
12h30-14h00	Lunch
14h00-15h00	Open discussion
15h00-15h15	Closing remarks