| 08:30-08:40 |
Michael Jünger, Giovanni Rinaldi |
| Welcome |
|
| 08:40-09:10 |
Friedrich Eisenbrand |
| Fast integer programming in fixed dimension |
|
| 09:10-09:40 |
Matteo Fischetti |
| Computational experience with 0-1/2 cuts |
|
| 09:40-10:10 |
Giampaolo Oriolo |
| On non-rank facets of the stable set polytope of
claw-free graphs and circulant graphs |
|
| 10:30-11:00 |
Martin Skutella |
| Multicommodity flows over time |
|
| 11:00-11:30 |
Katharina Langkau |
| A model for flow-dependent transit times |
|
| 11:30-12:00 |
René Weiskircher |
| An O(n log n) algorithm for the fractional
prize collecting Steiner tree problem on trees |
|
| 17:30-18:00 |
Volker Kaibel |
| Polytope isomorphism problems |
|
| 18:00-18:30 |
Christoph Buchheim |
| Fuzzy symmetry and common subgraph detection |
|
| 18:30-19:00 |
Marc Uetz |
| Enumeration of minimal covers and minimal forbidden
sets |
|
| 19:00-19:30 |
Juan-José Salazar-González |
| Minimizing the bandwidth of an undirected graph |
|
| 08:30-09:00 |
Egon Balas |
| Pivot and Shift: A heuristic for MIP |
|
| 09:00-09:30 |
Ernst Althaus |
| SCIL - Symbolic Constraints in Integer
Linear programming |
|
| 09:30-10:00 |
Klaus Wenger |
| Small instance relaxations for the
traveling salesman problem |
|
| 10:30-11:00 |
Claude Lemarechal |
| A primal-dual heuristic which works,
although it should not |
|
| 11:00-11:30 |
Angelika Wiegele |
| Semidefinite relaxations for sparse
max-cut problems |
|
| 11:30-12:00 |
Stephan Tiedemann |
| Conditional value-at-risk in stochastic
programs with mixed-integer recourse |
|
| 17:30-18:00 |
Alberto Caprara |
| Packing 2-dimensional bins in harmony |
|
| 18:00-18:30 |
Michele Monaci |
| A set covering based heuristic approach
for bin-packing problems |
|
| 18:30-19:00 |
Jens Massberg |
| Clocktree design |
|
| 19:00-19:30 |
Bernard Fortz |
| Synthesis of tree networks |
|
| 08:30-09:00 |
Andreas Schulz |
| Approximate Local Search |
|
| 09:00-09:30 |
Laura Heinrich-Litan |
| Nearest-neighbor search in higher
dimensions |
|
| 09:30-10:00 |
Uwe Zimmermann |
| Rail Car Shunting |
|
| 10:30-11:00 |
Robert Weismantel |
| Duality for 0/1 programming problems |
|
| 11:00-11:30 |
Matthias Koeppe |
| The Integral Basis Method and extensions
to mixed-integer programming |
|
| 11:30-12:00 |
Marc Pfetsch |
| The maximum feasible subsystem problem and
polyhedra |
|
| 17:30-18:00 |
Jack Edmonds |
| The Berge-graph robust algorithm problem |
|
| 18:00-18:30 |
Jean François Maurras |
| From membership to separation
for polyedra, a simple construction |
|
| 18:30-19:00 |
Paolo Ventura |
| Perfect matching: a compact linear
formulation of the active cone |
|
| 19:00-19:30 |
Marco Lübbecke |
| On the stabbing number of matchings,
trees, and triangulations |
|
| 08:30-09:00 |
Lisa Fleischer |
| Approximating optimal control of fluid networks |
|
| 09:00-09:30 |
Tom McCormick |
| A strongly polynomial algorithm for
bisubmodular function minimization |
|
| 09:30-10:00 |
Ekkehard Köhler |
| On the k-splittable flow problem |
|
| 10:30-11:00 |
Maurice Queyranne |
| On the node flow cone of an acyclic
network |
|
| 11:00-11:30 |
Sandor Fekete |
| Online searching with turn cost |
|
| 11:30-12:00 |
Sunil Chandran |
| Girth and treewidth |
|
| 17:30-18:00 |
Giacomo Zambelli |
| On the strong perfect graph conjecture |
|
| 18:00-18:30 |
Annegret Wagler |
| Almost all webs are not rank-perfect |
|
| 18:30-19:00 |
Kathie Cameron |
| List partitions of graphs |
|
| 19:00-19:30 |
Denis Cornaz |
| Chromatic characterization of biclique covering |
|
| 08:30-09:00 |
Jens Vygen |
| Advances in global routing |
|
| 09:00-09:30 |
Matthias Müller-Hannemann |
| Slack and power optimization
of inverter trees in VLSI design |
|
| 09:30-10:00 |
Dieter Rautenbach |
| On the band-, tree- and clique-width of
graphs with bounded vertex degree |
|
| 10:30-11:00 |
Andrea Lodi |
| New approaches for optimizing over the
semimetric polytope |
|
| 11:00-11:30 |
Pierre Pesneau |
| Two-edge connected subgraphs with bounded
rings |
|
| 11:30-12:00 |
Edoardo Amaldi |
| On the approximability of the minimum
fundamental cycle basis problem |
|