Chair: | Michael Juenger |

9.00 | A. Letchford: "Mod-2 cuts for the Stable Set Problem" |

9.30 | R. Hemmecke: "Decomposition of test sets in stochastic programming" |

10.00 | T. Ziegler: "The Constrained Crossing Minimization Problem" |

10.30 | Coffee |

Chair: | Gerhard Reinelt |

11.30 | L. Fleischer: "Approximating fractional multicommodity flow independent of the number of commodities" |

12.00 | L. Finschi: "Cocircuit graph orientation" |

12.30 | Lunch |

17.00 | Coffee |

Chair: | Giovanni Rinaldi |

17.30 | G. Galambos: "Data compression" |

18.30 | R. Schultz: "Stochastic integer programming" |

19.30 | Dinner |

Chair: | Gabor Galambos |

8.30 | T. Koch: "Solving Steiner tree problems in graphs to optimality" |

9.00 | L. Brunetta: "Solving feedback vertex set problems on undirected graphs" |

9.30 | G. Klau: "Optimal compaction of orthogonal grid drawings" |

10.00 | Coffee |

Chair: | Ruediger Schultz |

10.30 | M. Labbé: "The median cycle problems" |

11.00 | E. Dahlhaus: "Nested dissection and minimal elimination ordering" |

11.30 | E. Amaldi: "Infeasible linear systems: Finding max/min partitions into feasible subsystems" |

12.00 | Lunch |

17.00 | Coffee |

Chair: | Bernhard Korte |

17.30 | M. Queyranne: "On optimum size-constrained set partitions" |

18.10 | L. Trotter: "A branch and cut algorithm for capacitated vehicle routing" |

18.50 | J. Edmonds: "Combinatorial pivoting to obtain a second Hamiltonian cycle" |

19.30 | Dinner |

Chair: | Maurice Queyranne |

8.30 | B. Spille: "Augmentation algorithms for intersecting integer programming" |

9.00 | G. Lancia: "A branch and price algorithm for minimum routing cost trees" |

9.30 | B. Verweij: "A branch and cut algorithm for independent set applied to map labelling problems" |

10.00 | Coffee |

Chair: | Les Trotter |

10.30 | M. Oswald: "Polyhedral aspects of the consecutive ones problem" |

11.00 | V. Kaibel: "Simple 0-1-polytopes" |

11.30 | F. Eisenbrand: "Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube" |

12.00 | Lunch |

17.00 | Coffee |

Chair: | Egon Balas |

17.30 | E. Speckenmeyer: "A new graph theoretic problem from logic" |

18.10 | R. Moehring: "Project risk management: Mathematical models & methods" |

18.50 | B. Korte: "How long lives a bit in a computer?" |

19.30 | Dinner |

21.00 | Working Group: Perfect Graphs |

Chair: | Ewald Speckenmeyer |

8.30 | C. Feremans: "The generalized min. spanning tree problem: polyhedra and branch and cut" |

9.00 | R. Weiskircher: "Optimizing over all embeddings of a planar graph" |

9.30 | S. Leipert: "Computing a level planar embedding in linear time" |

10.00 | Coffee |

Chair: | Rolf Moehring |

10.30 | A. Martin: "Integer Programs with block structure" |

11.00 | M. Skutella: "A PTAS for minimizing the total weighted completion time on identical parallel machines" |

11.30 | R. Firla: "On the design of exponential neighborhood for local search algorithms" |

12.00 | Lunch |

17.00 | Coffee |

Chair: | Jack Edmonds |

17.30 | F. Rendl: "Semidefinite Programming applied to combinatorial optimization" |

18.10 | S. Chopra: "Mult-Level network design" |

18.50 | E. Balas: "Lifted cycle inequalities for the ATSP and connections with the symmetric TS polytope" |

19.30 | Dinner |

Chair: | Sunil Chopra |

8.30 | A. Caprara: "Models and algorithms for the train scheduling problem" |

9.00 | A. Lodi: "A branch and cut algorithm for the multiple depot vehicle scheduling problem" |

9.30 | S. van Hoesel: "Scheduling football competitions with branch and cut" |

10.00 | Coffee |

Chair: | Fraz Rendl |

10.30 | T. Mc Cormick: "One polynomial algorithm that solves lots of network type problems" |

11.00 | B. Klinz: "On the transportation problem with permutable demand vector" |

11.30 | C. Hurkens: "On generating infeasible Cornuejols-Dawande instances" |

12.00 | D. Naddef: "The diversity management problem" |

12.30 | Lunch |