PROGRAM
Monday 14
Chair:Giovanni Rinaldi
08:30-08:45
The Organizers
Welcome
08:45-09:15
Maurice Queyranne
Towards robust revenue management
09:15-09:45
Volker Kaibel
Two new bounds on the random-edge simplex algorithm
09:45-10:15
Christoph Helmberg
Online truck scheduling for inventory management

Chair:Michael Jünger
10:45-11:15
Kent Andersen and Yves Pochet
Improving the formulation of a mixed integer program
11:15-11:45
Marc Uetz
Scheduling with resource dependent processing times
11:45-12:15
Carsten Gutwenger
Graph embedding with minimum depth and maximum external face

Chair:Gerhard Reinelt
17:30-18:00
Vincent Jost
Chromatic scheduling: New results and problems
18:00-18:30
Annegret Wagler
About the imperfection ratio of A-perfect graphs and some consequences
18:30-19:00
Angelika Wiegele
A boundary point method for semidefinite programs
19:00-19:30
Quentin Louveaux
Polyhedral properties of the intersection of two knapsacks


Tuesday 15
Chair:Uwe Zimmermann
08:30-09:00
Rüdiger Schultz
Formulating and solving multistage stochastic integer programs with risk objectives
09:00-09:30
Isaac Plana
On the windy general routing problem
09:30-10:00
Ekkehard Köhler
Dynamic routing of AGVs

Chair:Bruce Shepherd
10:30-11:00
Maria Chudnovsky
Quasi line graphs & Rebea's conjecture
11:00-11:30
Gautier Stauffer
The stable set polytope of quasi-line graphs
11:30-12:00
Kathie Cameron
Independent packings in structured graphs

Chair:Andrea Lodi
17:30-18:00
Pierre Fouilhoux
The maximum bipartite induced subgraph problem and DNA sequencing
18:00-18:30
Christoph Buchheim
Efficient reduction of polynomial zero-one optimization to the quadratic case
18:30-19:00
Alberto Caprara
The basic approach to 0/1 quadratic programming
19:00-19:30
Jon Lee
In situ column generation for a cutting-stock problem


Wednesday 16
Chair:Matteo Fischetti
08:30-09:00
Egon Balas
The vertex separator problem
09:00-09:30
Anureet Saxena
Facets of the set-covering polytope with coefficients in {0,1,2,3}
09:30-10:00
Fabrizio Grandoni
Improved virtual private network design approximation

Chair:Yves Pochet
10:30-11:00
Juan José Salazar González
Comparing formulations of the capacitated vehicle routing problem
11:00-11:30
Dirk Oliver Theis
Not every GTSP facet induces an STSP facet
11:30-12:00
Pierre Pesneau
Solving the precedence constrained ATSP with an extended formulation

Chair:Jean François Maurras
17:30-18:00
Nitin Ahuja
Modelling and solving a min-max problem as a graph coloring problem
18:00-18:30
Pierre Charbit
Cyclic orders: equivalence and duality
18:30-19:00
Matthias Köppe
Towards primal-dual integer programming
19:00-19:30
Alexander Kröller
Algorithmic aspects of large sensor networks
19:30-19:45
Sándor Fekete
Searching with an autonomous robot


Thursday 17
Chair:Egon Balas
08:30-09:00
Bruce Shepherd
Integrality gaps for throughput flow
09:00-09:30
Uwe Zimmermann
Minimum partitions of permutations
09:30-10:00
David Steurer
An asymptotic approximation scheme for multigraph edge coloring

Chair:Paolo Toth
10:30-11:00
Hal Sudborough
A two approximation algorithm for block sorting
11:00-11:30
Denis Cornaz
A simple and tractable formulation for the node coloring problem
11:30-12:00
Elisabeth Gassner
A linear time algorithm for the reverse 1-median problem on a cycle

Chair:Rainer Burkard
17:30-18:00
Matteo Fischetti
Mixed-integer cuts from cyclic groups
18:00-18:30
Johannes Hatzl
Mixed-integer programs and heuristics for batch processes
18:30-19:00
Mathieu Van Vyve
The continuous mixing polyhedron
19:00-19:30
Andrea Lodi
Optimizing over the first Chvátal closure


Friday 18
Chair:Rolf Möhring
08:30-09:00
William Cunningham
An algorithm for packing A-paths in a group-labelled graph
09:00-09:30
Miguel Anjos
A semidefinite approach to the single-row layout problem with unequal dimensions
09:30-10:00
Paolo Ventura
Mod-2 cuts generation yields the convex hull of bounded integer feasible sets

Chair:Denis Naddef
10:30-11:00
Claude Lemaréchal
A convex analysis perspective of (disjunctive) cuts
11:00-11:30
Edoardo Amaldi
Designing virtual private networks under traffic uncertainty
11:30-12:00
Matthias Müller-Hannemann
Throughput maximization in PC board assembly