9.00-9.30

Registration

9.30-11.00	WA1: Complexity and Approximation of Scheduling Problems  Organised and chaired  by F.C.R. Speiksma	WB1 Assignment Chair: E. Çela	WC1 Integer Programming: Chair: B.M. Smith
9.30-10.00	T.Erlebach, F.C.R. Spieksma Competitive Analysis of a Weighted Interval Scheduling Problem	D. Cattrysse A Survey of Algorithms for the Generalized Assignment Problem	M. Hadjiat-Guerinik,  N. Guerinik A Successful Combination of Integer Linear Programming and Constraint Programming
10.00-10.30	J. Hurink, S. Knust Integrating Transport into a Job Shop	R.V. Skomorokhov Job Shop Scheduling and Assignment Problems: New Approach to Solving	M. Schröder Balanced Tree Partitioning
10.30-11.00	D.B.C. Faneyte,  F.C.R. Spieksma,  G.J. Woeginger A Branch-and-Price Algorithm for a Crane Scheduling Problem	S. Yan, M. Chen, C.-M. Huo A Model for Multiple Objective Gate Assignments	M.V. Devyaterikova,  A.A. Kolokolov Analysis of L-Structure Stability of a Knapsack Problem (cancelled) P. Eveborn, M. Rönnqvist Solving Hard School Timetabling Problems using Column Generation (transferred from FC2)

11.00-11.30	Coffee break
11.30-12.30	Plenary Talk:  Thomas Liebling Hidden Markov Models  for Biomolecular Motif Discrimination Chair: R.R. Weber
12.30-14.00	Lunch break

14.00-15.30	WA2 Optimization in Networks  Organised by B. Fortz Chair: D.L. Woodruff	WB2 Location and  Routing  Chair: D.B. Shmoys	WC2 Meta-Heuristics Chair: J.Hurink
14.00-14.30	C. Feremans, M. Labbé,  G. Laporte  Polyhedral Analysis of the Generalized Minimum Spanning Tree Problem	P. Cappanera, G. Gallo,  F. Maffioli Discrete Facility Location and Routing of Obnoxious Activities	K. Steinhöfel, A. Albrecht,  C.K. Wong A Problem-Specific Complexity Bound for Job Shop Scheduling
14.30-15.00	M. Gendreau, F.-X. LeLouarn, J.-Y. Potvin An Ant Colony System Heuristic for the Traveling Salesman Problem	G. Nagy, S. Salhi  An Integrated Approach To Hub Location	H. Bouziri, K. Mellouli Tabu Search for the Task Allocation on Parallel Machines
15.00-15.30	S.P.M. van Hoesel, A.M.C.A. Koster,  R.L.M.J. van de Leensel, M.W.P. Savelsbergh Polyhedral Results for the Edge Capacity Polytope	L. Muyldermans, D. Cattrysse, D. Van Oudheusden A Districting and a Location- Districting Model for Salt Spreading Operations	A. Vesel, J. Žerovnik Constant Temperature “Annealing'' is Competitive

15.30-16.00

Coffee break

16.00-18.00	WA3 Probabilistic Analysis of Algorithms  Organised and chaired  by M. Jerrum	WB3 Polyhedral Optimisation Chair: R.W. Eglese	WC3 Travelling Salesman Problem Chair: G.J. Woeginger
16.00-16.30	R.R. Weber The Sum-of-Squares Algorithm for Bin Packing	R.P. Barneva, V.E. Brimkov On the Knapsack Polytope	G. Gutin How to Find A Travelling Salesman Tour Which Is Better Than Many Others
16.30-17.00	A. Frieze Probabilistic Analysis of Random Travelling Salesman Problems	J.E. Mitchell Branch-and-cut for the k-way Equipartition Problem	I. Kara, T. Bektas Derivation of the Miller-Tucker- Zemlin Subtour Elimination Constraints of the Traveling Salesman Problem
17.00-17.30	M.E. Dyer Probabilistic Analysis of Binary Constraint Satisfaction Problems	A.N. Letchford, R.W. Eglese Complexity of a Separation Problem	E.Kh. Gimadi, A.I. Serdyukov Polynomial Approximation Scheme for Asymmetric Polyhedral Max TSP
17.30-18.00	D. Achlioptas, G. Sorkin Optimal Policies for Greedy 3-SAT Algorithms	F. Bendali, A.R. Mahjoub,  J. Mailfert Composition of Graphs and the K_3-Cover Polytope (cancelled)	V. Deineko Polynomially Solvable Cases of the Travelling Salesman  Problem and Heuristic Algorithms