PROGRAM
Monday 13
Chair:Rolf Möhring
09:00-09:15
Thomas Liebling, Denis Naddef, Laurence Wolsey
Introduction
09:15-09:45
Egon Balas
The latest on lift and project
09:45-10:15
Miguel Constantino
On the connected subgraph problem

Chair:Sunil Chopra
10:45-11:15
Tom McCormick
Large scale 2-terminal wire routing in VLSI chips : when Dijkstra's algorithm is too slow
11:15-11:45
André Rohe
Rectilinear group Steiner trees and applications in VLSI design
11:45-12:15
Christoph Albrecht
Global routing for VLSI chips by combinatorial optimization algorithms for the multi-commodity flow problems

Chair:Michele Conforti
17:30-18:00
Rainer Burkard
An event driven model for batch processing in the chemical industry
18:00-18:30
Ellis Johnson and Ladislav Lettovský
Airline schedule planning and recovery
18:30-19:00
Juan José Salazar Gonzalez
The traveling purchaser problem: theoretical and practical polyhedral results
19:00-19:30
Gabor Pataki
Can Farkas survive without Slater?

Tuesday 14
Chair:Jean Fonlupt
08:45-09:15
Maurice Queyranne
Hotel yield management: a stochastic integer programming model with a Monge property
09:15-09:45
Utz Uwe Haus
Basis reduction
09:45-10:15
Corinne Feremans
Polyhedral analysis of the general minimum spanning tree problem

Chair:Bernhard Korte
10:45-11:15
David Applegate
Connections between mixed 0/1 cuts
11:15-11:45
Adam Letchford
On disjunctive cuts for combinatorial optimization
11:45-12:15
Michael Perregaard
Connections between mixed 0/1 cuts

Chair:Leslie Trotter
17:30-18:00
Günter Rote
Can every polygon be untangled?
18:00-18:30
Andrew Miller
Solving multi items lot sizing problems with set up times
18:30-19:00
Erich Steiner
Action elimination based on first order optimality conditions for stochastic DP
19:00-19:30
Gabor Pataki
Can Farkas survive without Slater?

Wednesday 15
Chair:Paolo Toth
08:45-09:15
Andreas Schulz
e-Optimization and L-bit precision: alternative models in combinatorial optimization
09:15-09:45
Marc Uetz
Resource constrained scheduling: from minimum cuts to feasible schedule
09:45-10:15
Edoardo Amaldi
Finding sparse approximate solutions to linear systems and an application to portfolio optimization

Chair:Gerd Finke
10:45-11:15
Martin Skutella
Cooperative facility location games
11:15-11:45
Jens Vygen
On dual minimum cost flow algorithms
11:45-12:15
Bram Verweij
The merchant subtour problem

Chair:Gerd Reinelt
17:30-18:00
Alberto Caprara
Packing cuts and cycles in undirected graphs
18:00-18:30
Matthias Köppe
Test sets for mixed integer sets
18:30-19:00
Matthias Müller-Hannemann
A combinatorial approach to hexahedral mesh generation
19:00-19:30
Christian Szegedy
Symplectic spaces and ear decomposition of graphs and matroids

Thursday 16
Chair:Martine Labbé
08:45-09:15
Lisa Fleischer
Submodular flows without submodular function minimization
09:15-09:45
Gianpaolo Oriolo
On the stable set polytope of quasi-line graphs
09:45-10:15
François Margot
Small covering designs

Chair:Ellis Johnson
10:45-11:15
Stan Van Hoesel
Frequency assignment algorithms
11:15-11:45
François Oustry
SDP and Lagrange duality with applications to combinatorial optimization
11:45-12:15
Ted Ralphs
A branch and cut algorithm for the vehicle routing problem

Chair:Matteo Fischetti
17:30-18:00
Jon Lee
New and old bounds for maximum-entropy sampling
18:00-18:30
Andrea Lodi
ILP models for 2D shelf packing problems
18:30-19:00
Petra Mutzel
A new approach to map labeling

Friday 17
Chair:Michael Jünger
08:45-09:15
Cor Hurkens
Gossiping efficiently
09:15-09:45
Clemens Heuberger
n Hamiltonian Toeplitz graph
09:45-10:15
François Vanderbeck
A nested decomposition approach for 2d three stages cutting problems
10:15-10:45
Lisa Fleischer
Submodular flows, cont