9.30-11.00	TA1: Organised and chaired  by B. Klinz	TB1 Network Design Chair: S.A.P. van Hoesel	TC1 Vehicle Routing Chair: E. Hadjiconstantinou
9.30-10.00	S. Iwata, L. Fleischer,  S. Fujishige A Combinatorial, Strongly Polynomial-Time Algorithm for Minimizing Submodular Functions	A.G. Santos, G. R. Mateus A Cutting Plane Approach to Solving a Network Design Problem	Ø. Halskau  Pick-Ups and Deliveries from Depots - an Alternative Approach
10.00-10.30	B. Klinz, R.E. Burkard Budget-Constrained Upgrading and Downgrading Problems in Combinatorial Optimization	S. Haddad, A. Laugier,  J.-F. Maurras Designing Telecommunication Networks with Global Capacity under Survivability Constraints	J. Lysgaard, A.N. Letchford, R.W. Eglese A Branch and Cut algorithm for the Vehicle Routing Problem
10.30-11.00	E. Necciari, M. Nonato,  M.G. Scutellà (cancelled) Multi-Exchange Algorithms for Constrained Shortest Path Problems V.M. Kotov On-Line k-item Bin Packing Problem (tranferred from FB2)	L. Grouz Djerbi, A.Billionnet,  S. Elloumi Designing Radio-Mobile Access Networks Based on SDH Rings	D. Feillet, P. Dejax,  M. Gendreau Column Generation Approaches for a Freight Transportation Problem

11.00-11.30	Coffee break
11.30-12.30	Plenary Talk:  David Shmoys Approximation Algorithms for Location Problems Chair: M.E. Dyer
12.30-14.00	Lunch break

14.00-16.00	TA2 Machine and Server Scheduling Organised and chaired  by P. Brucker	TB2 Combinatorial Optimisation Chair: S. Iwata	TC2 Supply Chain and  Logistics Applications Chair: D. Cattrysse
14.00-14.30	N. Brauner, G. Finke One-Unit Production Cycles in Robotic Cells: Dominance and Complexity	M. Dell'Amico, F. Maffioli, F. Malucelli The Base-Matroid and Inverse Combinatorial Optimization Problems	M. Rönnqvist, C.G. Carlgren, J. Lundgren, D. Carlsson,  A. Mason Supply Chain Optimization at Pulp Mills
14.30-15.00	S. Knust, J. Hurink Scheduling a Single Robot in a Job-Shop Environment	V. Shenmaier A Greedy Algorithm for One Class of Integer Programs	S. Voss, D.L. Woodruff.  Supply Chain Planning: Is mrp a Good Starting Point?
15.00-15.30	P. Brucker, S. Knust,  C. Dhaenens-Flipo,  S.A. Kravchenko, F. Werner Complexity Results for Parallel Machine Problems with a Single Server	B. Goldengorin Components of Strict and Saddle Local Maxima for the Maximization of Submodular Functions	R. Baldacci, V. Maniezzo,  A. Mingozzi Exact and Heuristic Methods for the Car Pooling Problem
15.30-16.00	B. Hammer Complexity Results for Feedforward Perceptron Networks	L. Gouveia, M.J. Lopes (cancelled) A Family of Flow Based Formulations for the Capacitated Minimum Spanning Tree Problem	P. Beullens, D. Cattrysse,  D. Van Oudheusden A Decision Support Tool for Recycling

16.00-16.30	Coffee break
16.30-17.30	Plenary talk:  Barbara Smith The Art of Modelling for Constraint Programming Chair: C.N. Potts

17.30-19.00	TA3 Military and Cargo Loading Appliations  Organised and chaired  by A.I. Barros	TB3 Scheduling I Chair: S. Knust	TC3 Graphs Chair: E. Kh. Gimadi
17.30-18.00	R.K. Kincaid Sensor and Actuator Placement Problems	G. Confessore, P. Dell'Olmo,  S. Giordani An Approximation Result for a Multiprocessor Task Sheduling Problem with Consecutive Constraints	V.E. Brimkov Shortest Path Searching in Certain Graphs
18.00-18.30	A.I. Barros An Integer Programming Based Method for Loading Military Cargo Aircraft	J.A. Hoogeveen, M. Skutella, G.J. Woeginger Preemptive Scheduling with Rejection	R.E. Burkard, E. Çela,  H. Dollani 2-Median Problem in Trees with Pos/Neg Weights
18.30-19.00	D. Barbucha A Greedy Heuristic for the Generalized Segregated Storage Problem	K. Pruhs Broadcast Scheduling	W. Kern, D. Paulusma Complexity of Matching Games