| Chair: Michael Jünger | ||
| 08:15-08:30 | Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi | Welcome |
| 08:30-09:00 | Robert Weismantel | Convex relaxations in mixed integer nonlinear programming |
| 09:00-09:30 | Christoph Buchheim | A slightly extended formulation for nonlinear 0/1 optimization problems |
| 09:30-10:00 | Jose´ Neto | Spectral bounds for the max-cut problem |
| COFFEE BREAK | ||
| Chair: Gerhard Reinelt | ||
| 10:30-11:00 | Thomas Rothvoß | An improved bound for the random sampling algorithm for connected facility location |
| 11:00-11:30 | Jarek Byrka | n optimal bifactor approximation algorithm for the metric uncapacitated facility location problem |
| 11:30-12:00 | Jens Massberg | Facility location and clocktree design |
| LUNCH/SKI BREAK | ||
| Chair: Giovanni Rinaldi | ||
| 17:30-18:00 | Karen Aardal | Using input structure to solve hard integer programs |
| 18:00-18:30 | Gabor Pataki | Column basis reduction, and decomposable knapsack problems |
| 18:30-19:00 | Volker Kaibel | Orbitopal fixing |
| 19:00-19:30 | Sanjeeb Dash | The general master knapsack polyhedron |
Tuesday, 9 January
| Chair: Rolf H. Möhring | ||
| 08:30-09:00 | Martin Skutella | A network flow problem with unit path capacities |
| 09:00-09:30 | Ronald Koch | Nash equilibria for flows over time |
| 09:30-10:00 | Tom McCormick | Parametric minimum cuts: how far? how fast? |
| COFFEE BREAK | ||
| Chair: Laurence A. Wolsey | ||
| 10:30-11:00 | Egon Balas | Lift-and-project and the cycle polytope |
| 11:00-11:30 | Jean-François Maurras | On the k-cliques polyhedra |
| 11:30-12:00 | Quentin Louveaux | Cutting planes from lattice-point-free polyhedra |
| LUNCH/SKI BREAK | ||
| Chair: Uwe Zimmermann | ||
| 17:30-18:00 | Elisabeth Gassner | Inverse maxian problems with variable edge lengths on a tree |
| 18:00-18:30 | Marc Pfetsch | Exact support minimum solutions to underdetermined linear equations |
| 18:30-19:00 | Gennady Shmonin | Testing integer rounding properties |
| 19:00-19:30 | Benjamin Leveque | Optimizing diversity |
Wednesday, 10 January
Thursday, 11 January
Chair: Manfred W. Padberg| Chair: Egon Balas | ||
| 08:30-09:00 | Giampaolo Oriolo | A short proof of the VPN conjecture on a ring |
| 09:00-09:30 | Markus Chimani | A new cut formulation for fiber-optics networks with redundancy |
| 09:30-10:00 | Elke Eisenschmidt | Integral decomposition of discrete/polyhedral sets and the design of survivable networks |
| COFFEE BREAK | ||
| Chair: Martine Labbé | ||
| 10:30-11:00 | David P. Williamson | A general technique for incremental approximation and hierarchical clustering |
| 11:00-11:30 | Aykut Ozsoy | Clique partitioning with size constraints |
| 11:30-12:00 | CANCELLED | |
| LUNCH/SKI BREAK | ||
| 17:30-18:00 | Juan-José Salazar-Gonzalez | The travelling salesman problem with pickups and deliveries of stochastic demands |
| 18:00-18:30 | Christian Schulte | VLSI yield optimization in detailed routing |
| 18:30-19:00 | Valentina Cacchiani | Solving a real-world train unit assignment problem |
| 19:00-19:30 | Matthias Prandtstetter | Reconstructing sheets of manually torn paper |
Friday, 12 January
| Chair: Gérard Cornuéjols | ||
| 08:30-09:00 | Immanuel Bomze | The first cut is the cheapest-improving SDP bounds for the clique number |
| 09:00-09:30 | Christoph Helmberg | Experiments with linear and semidefinite relaxations for solving the minimum graph bisection problem |
| 09:30-10:00 | Marco Lübbecke | Optimizing the Swiss cargo network |
| COFFEE BREAK | ||
| Chair: Denis Naddef | ||
| 10:30-11:00 | Florent Cadoux | Wolfe's projection algorithm applied to the computation of disjunctive cuts |
| 11:00-11:30 | Anureet Saxena | MIPing probabilistic constraints with random right hand sides |
| 11:30-12:00 | Matteo Fischetti | MIP models for MIP heuristics |
| LUNCH / ONE-YEAR BREAK |