PROGRAM
Monday 8
Chair:Martin Grötschel
09:00-09:30
The Organizers
Welcome
09:30-10:15
Maurice Queyranne
Contraction Methods and the Minimization of Symmetric Submodular Functions
10:45-11:30
Antonio Sassano
Reducible Cliques and the Strong Perfect Graph Conjecture
11:30-12:15
Robert van de Leensel
On Knapsack Problems with Order Relations

Chair:Michele Conforti
17:30-18:15
Martine Labbé
On the two-level uncapacitated Facility Location
18:15-18:45
Thomas Christof
Computation and Separation of small Facets
18:45-19:15
Michael Jünger
Computational Results for the Min-Cut Problem

Tuesday 9
Chair:Gérard Cornuéjols
08:45 09:30
Egon Balas
Enhancements of Lift and Project
09:30-10:00
François Margot
Intersection Cuts for 0-1 Integer Programming
10:30-11:15
Stan van Hoesel
Solving the Frequency Assignment Problem
11:15-12:00
Alexander Martin
Optimal Routing in Layered Telecommunication Networks

Chair:Monique Laurent
17:30-18:15
Thomas McCormick
A Polynomial Algorithm for Abstract Max-Flow
18:15-18:45
Jean François Pusztaszeri
Tracking Elementary Particles with Integer Programming
18:45-19:15
Maarten Oosten
Sequential Lifting Procedures

Wednesday 10
Chair:Maurice Queyranne
09:00-09:30
Paolo Toth
Heuristic Algorithm for Crew Rostering Problems
09:30-10:00
Bertrand Guenin
Clutters with the Max-Flow Min-Cut Property
10:00-10:30
Juan José Salazar González
A Branch And Cut Algorithm for the Orientering Problem
11:00-11:30
Komei Fukuda
On the Existence of a Short Sequence of Admissible Pivots to an Optimal Basis in LP and LCP
11:30-12:00
Stefan Thienel
ABACUS: A Branch and Cut System

Chair:Alain Prodon
17:30-18:15
Alexander Schrijver
Bipartite Edge Colouring
18:15-18:45
Regina Urbaniak
Test Sets under Graph Operations
18:45-19:15
François Vanderbeck
On IP Decomposition and Enforcing Integrality in the Master

Thursday 11
Chair:Ellis Johnson
09:00-09:30
Matteo Fischetti
Data Security and the Bridgeless Subgraph Problem
09:30-10:00
Olivier Goldschmidt
Faster Algorithm for the 3-Cut Problem
10:00-10:30
Miguel Constantino
Variable Lower Bounds on Lot Sizing Problems
11:00-11:45
Petra Mutzel
Optimization on 2-Layered Networks
11:45-12:15
Alberto Caprara
Sorting Permutations by Reversals

Chair:Egon Balas
17:30-18:15
Martin Savelsberg
Sequence Independent Lifting of Flow Covers
18:15-18:45
Bernard Fortz
A Branch and Cut Algorithm for Designing Reliable Telecommunication Networks
18:45-19:15
Neil Simonetti
An Efficient Algorithm for some Instances of the TSP with Time Windows

Friday 12
Chair:Rainer Schrader
09:00-09:45
Ellis Johnson
Solving LP's from Cutting Stock and CrewScheduling Problems
09:45-10:15
Georg Wambach
Scheduling Setups
10:45-11:15
Daniel Bienstock
Current Work on Network Design Problems
11:15-12:00
Adrian Brüngger and Ambros Marzetta
Parallel Vertex Enumeration using the Parallel Search Algorithm Library ZRAM