| |
Monday, March 13, 2000 |
|---|
| 09:00 |
Introduction: Thomas Liebling, Denis Naddef, Laurence Wolsey |
|---|
| | Chair: Rolf Moehring, Berlin |
| 09:15 |
Egon Balas, Pittsburgh: The latest on lift and project |
|---|
| 09:45 |
Miguel Constantino, Lisboa: On the connected subgraph problem |
|---|
| 10:15 | Break |
|---|
| | Chair: Sun il Chopra |
| 10:45 |
Tom Mc Cormick, Vancouver: Large scale 2-terminal wire routing in VLSI chips : when Dijkstra's algorithm is too slow |
|---|
| 11:15 |
André Rohe, Bonn: Rectilinear group Steiner trees and applications in VLSI design |
|---|
| 11:45 |
Christoph Albrecht, Bonn: Global routing for VLSI chips by combinatorial optimization algorithms for the multi-commodity flow problems |
|---|
| 12:15 | Break |
|---|
| | Chair: Michele Conforti, Padova |
| 17:30 |
Rainer Burkard, Graz: An event driven model for batch processing in the chemical industry |
|---|
| 18:00 |
Ladislav Lettovskı & Ellis Johnson, Atlanta: Airline schedule planning and recovery |
|---|
| 18:30 |
Juan José Salazar Gonzalez, La Laguna: The traveling purchaser problem: theoretical and practical polyhedral results |
|---|
| 19:00 |
Gabor Pataki, New York: Can Farkas survive without Slater? |
|---|
| |
Tuesday, March 14, 2000 |
|---|
| Chair: Jean Fonlupt, Paris |
| 08:45 |
Maurice Queyranne, Vancouver: Hotel yield management: a stochastic integer programming model with a Monge property |
|---|
| 09:15 |
Utz Uwe Haus, Magdeburg: Basis reduction |
|---|
| 09:45 |
Corinne Feremans, Bruxelles: Polyhedral analysis of the general minimum spanning tree problem |
|---|
| 10:15 | Break |
|---|
| | Chair: Bernhard Korte |
| 10:45 |
David Applegate, Austin: Another branching rule for the TSP |
|---|
| 11:15 |
Adam Letchford, Lancaster: On disjunctive cuts for combinatorial optimization |
|---|
| 11:45 |
Michael Perregard, Pittsburgh: Connections between mixed 0/1 cuts |
|---|
| 12:15 | Break |
|---|
| | Chair: Leslie Trotter |
| 17:30 |
Günter Rote, Berlin: Can every polygon be untangled? |
|---|
| 18:00 |
Andrew Miller, Louvain-la-Neuve: Solving multi items lot sizing problems with set up times |
|---|
| 18:30 |
Erich Steiner, Lausanne: Action elimination based on first order optimality conditions for stochastic DP |
|---|
| 19:00 |
Gabor Pataki, New York: Can Farkas survive without Slater? |
|---|
| |
Wednesday, March 15, 2000 |
|---|
| Chair: Paolo Toth, Bologna |
| 08:45 |
Andreas Schulz, Cambridge Mass.: e-Optimization and L-bit precision: alternative models in combinatorial optimization |
|---|
| 09:15 |
Marc Uetz, Berlin: Resource constrained scheduling: from minimum cuts to feasible schedules |
|---|
| 09:45 |
Edoardo Amaldi, Milano: Finding sparse approximate solutions to linear systems and an application to portfolio optimization |
|---|
| 10:15 | Break |
|---|
| | Chair: Gerd Finke, Grenoble |
| 10:45 |
Martin Skutella, Berlin: Cooperative facility location games |
|---|
| 11:15 |
Jens Vygen, Bonn: On dual minimum cost flow algorithms |
|---|
| 11:45 |
Bram Verveij, Utrecht: The merchant subtour problem |
|---|
| 12:15 | Break |
|---|
| | Chair: Gerd Reinelt, Heidelberg |
| 17:30 |
Alberto Caprara, Bologna: Packing cuts and cycles in undirected graphs |
|---|
| 18:00 |
Matthias Koeppeg, Magdeburg: Test sets for mixed integer sets |
|---|
| 18:30 |
Matthias Müller-Hannemann, Berlin: A combinatorial approach to hexahedral mesh generation |
|---|
| 19:00 |
Christian Szegedy, Bonn: Symplectic spaces and ear decomposition of graphs and matroids |
|---|
| |
Thursday, March 16, 2000 |
|---|
| Chair: Martine Labbé, Bruxelles |
| 08:45 |
Lisa Fleischer, New York: Submodular flows without submodular function minimization |
|---|
| 09:15 |
Gianpaolo Oriolo, Roma: On the stable set polytope of quasi-line graphs |
|---|
| 09:45 |
François Margot, Lexington: Small covering designs |
|---|
| 10:15 | Break |
|---|
| | Chair: Ellis Johnson, Atlanta |
| 10:45 |
Stan Van Hoessel, Maastricht: Frequency assignment algorithms |
|---|
| 11:15 |
François Oustry, Grenoble: SDP and Lagrange duality with applications to combinatorial optimization |
|---|
| 11:45 |
Ted Ralphs, Houston: A branch and cut algorithm for the vehicle routing problem |
|---|
| 12:15 | Break |
|---|
| | Chair: Matteo Fischetti, Padova |
| 17:30 |
Jon Lee, Lexington: New and old bounds for maximum-entropy sampling |
|---|
| 18:00 |
Andrea Lodi, Bologna: ILP models for 2d shelf packing problems |
|---|
| 18:30 |
Petra Mutzel, Wien: A new approach to map labeling |
|---|
| |
Friday, March 17, 2000 |
|---|
| Chair: Michael Jünger, Köln |
| 08:45 |
Cor Hurkens, Eindhoven: Gossiping efficiently |
|---|
| 09:15 |
Clemens Heuberger, Graz: On Hamiltonian Toeplitz graphs |
|---|
| 09:45 |
François Vanderbeck, Bordeaux: A nested decomposition approach for 2d three stages cutting problems |
|---|
| 10:15 |
Lisa Fleischer, New York: Submodular flows, cont. |
|---|
| 10:45 |
Conclusion |
|---|