Program
Monday, March 5, 2001
| 09:00 - 09:15 | Introduction | Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi |
| 09:15 - 09:45 | Martin Skutella | Preemptive Scheduling with Rejection |
| 09:45 - 10:15 | Marc Uetz | Approximation Results for Scheduling under Uncertainty |
| 10:45 - 11:15 | Viet Hung Nguyen | A Procedure of Facets Composition for the Symmetric Traveling Salesman Polytope |
| 11:15 - 11:45 | Juan José Salazar | A Branch-and-Cut Algorithm for a Pickup-and-Delivery TSP |
| 11:45 - 12:15 | Marco Luebbecke | Combinatorial Restrictions on Pickup and Delivery Paths |
| 17:30 - 18:00 | Reinhardt Euler | Hajos' Construction and Polytopes |
| 18:00 - 18:30 | Volker Kaibel | Reconstructing a Simple Polytope from its Graph |
| 18:30 - 19:00 | Gerald Gruber | Lagrangean Relaxations for Max-Cut Using Bundle Methods |