Program
Tuesday, March 6, 2001
| 09:00 - 09:30 | Francesco Maffioli | Base-Matroids and Inverse Problems |
| 09:30 - 10:00 | Gerhard Woeginger | Scheduling with Buffers |
| 10:00 - 10:30 | Matteo Fischetti | Solution of Very Large Scale Crew Scheduling Problems |
| 11:00 - 11:30 | Adam Letchford | Primal Cutting Plane Methods Revisited |
| 11:30 - 12:00 | Jean-Philippe Richard | Mixed Integer Programming: News Cuts and a Gomory Type Algorithm |
| 12:00 - 12:30 | Raymond Hemmecke | Decomposition of Test Sets for (Mixed)-Integer Programs |
| 17:30 - 18:00 | Jean-Francois Maurras | The Polyhedron of the No |
| 18:00 - 18:30 | Marcus Oswald | Some Relations Between Consecutive Ones and Betweenness Polytopes |
| 18:30 - 19:00 | Laurence Wolsey | On the Wagner-Whitin Polytope |