direkt zum Inhalt springen
direkt zum Hauptnavigationsmenü
Sie sind hier
Suche
Institut für MathematikFG Kombinatorische Optimierung und Graphenalgorithmen
Sie sind auf Seite:1 | 2
Preprint 757-2002 Lisa Fleischer and Martin Skutella. Minimum Cost Flows Over Time without Intermediate Storage.
Preprint 048-2003 Jacques Desrosiers and Marco E. L\übbecke. A Primer in Column Generation.
Preprint 047-2003 Thomas Erlebach and Vanessa K\ä\äb, and Rolf H. M\öhring. Scheduling AND/OR-Networks on Identical Parallel Machines.
Preprint 037-2003 S\ándor P. Fekete and Marco E. L\übbecke and Henk Meijer. Minimizing the Stabbing Number of Matchings, Trees, and Triangulations.
Preprint 024-2003 Alex Hall and Katharina Langkau and Martin Skutella. An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times.
Preprint 050-2003 Berit Johannes. On the Complexity of Scheduling Unit-Time Jobs with OR-Precedence Constraints.
Preprint 023-2003 Sven O. Krumke and Nicole Megow and Tjark Vredeveld. How to Whack Moles.
Preprint 042-2003 Marco E. L\übbecke. Dual Variable Based Fathoming in Dynamic Programs for Column Generation.
Preprint 012-2003 Christian Liebchen. Finding Short Integral Cycle Bases for Cyclic Timetabling.
Preprint 016-2003 Christian Liebchen. Symmetry for Periodic Railway Timetables.
Preprint 049-2003 Christian Liebchen. Information on MIPLIB's timetab-instances.
Preprint 022-2003 Nicole Megow and Andreas S. Schulz. On-line scheduling to minimize average completion time revisited.
Preprint 043-2003 Michael R. Bussieck, Thomas Lindner, and Marco E. L\übbecke. A Fast Algorithm for Near Cost Optimal Line Plans.
Preprint 025-2003 Daniel Villeneuve and Jacques Desrosiers and Marco E. L\übbecke and Francois Soumis. On Compact Formulations for Integer Programs Solved by Column Generation.
Preprint 013-2006 Christian Liebchen and Gregor Wünsch. The Zoo of Tree Spanner Problems.