Technical Reports 2003 of the group Combinatorial Optimization & Graph Algorithms

Technical reports 2003

Technical Report 012-2003: Christian Liebchen

Finding Short Integral Cycle Bases for Cyclic Timetabling
Technical Report 016-2003: Christian Liebchen

Symmetry for Periodic Railway Timetables
Technical Report 022-2003: Nicole Megow and Andreas S. Schulz

On-line scheduling to minimize average completion time revisited
Technical Report 023-2003: Sven O. Krumke, Nicole Megow, and Tjark Vredeveld

How to Whack Moles
Technical Report 024-2003: Alex Hall, Katharina Langkau, and Martin Skutella

An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
Technical Report 025-2003: Daniel Villeneuve, Jacques Desrosiers, Marco E. Lübbecke, and Francois Soumis

On Compact Formulations for Integer Programs Solved by Column Generation
Technical Report 037-2003: Sándor P. Fekete, Marco E. Lübbecke, and Henk Meijer

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations
Technical Report 042-2003: Marco E. Lübbecke

Dual Variable Based Fathoming in Dynamic Programs for Column Generation
Technical Report 043-2003: Michael R. Bussieck, Thomas Lindner, and Marco E. Lübbecke

A Fast Algorithm for Near Cost Optimal Line Plans
Technical Report 047-2003: Thomas Erlebach and Vanessa Kääb and Rolf H. Möhring

Scheduling AND/OR-Networks on Identical Parallel Machines
Technical Report 048-2003: Jacques Desrosiers and Marco E. Lübbecke

A Primer in Column Generation
Technical Report 049-2003: Christian Liebchen

Information on MIPLIB's timetab-instances
Technical Report 050-2003: Berit Johannes

On the Complexity of Scheduling Unit-Time Jobs with OR-Precedence Constraints