direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 2003

vor >> [2]

2002

Preprint 757-2002
Lisa Fleischer and Martin Skutella.
Minimum Cost Flows Over Time without Intermediate Storage [3].


2003

Preprint 048-2003
Jacques Desrosiers and Marco E. Lübbecke.
A Primer in Column Generation [4].


Preprint 047-2003
Thomas Erlebach and Vanessa Kääb, and Rolf H. Möhring.
Scheduling AND/OR-Networks on Identical Parallel Machines [5].


Preprint 037-2003
Sándor P. Fekete and Marco E. Lübbecke and Henk Meijer.
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations [6].


Preprint 024-2003
Alex Hall and Katharina Langkau and Martin Skutella.
An FPTAS for Quickest Multicommodity Flows with Inflow-Dependent Transit Times [7].


Preprint 050-2003
Berit Johannes.
On the Complexity of Scheduling Unit-Time Jobs with OR-Precedence Constraints [8].


Preprint 023-2003
Sven O. Krumke and Nicole Megow and Tjark Vredeveld.
How to Whack Moles [9].


Preprint 042-2003
Marco E. Lübbecke.
Dual Variable Based Fathoming in Dynamic Programs for Column Generation [10].


Preprint 012-2003
Christian Liebchen.
Finding Short Integral Cycle Bases for Cyclic Timetabling [11].


Preprint 016-2003
Christian Liebchen.
Symmetry for Periodic Railway Timetables [12].


Preprint 049-2003
Christian Liebchen.
Information on MIPLIB's timetab-instances [13].


Preprint 022-2003
Nicole Megow and Andreas S. Schulz.
On-line scheduling to minimize average completion time revisited [14].


Preprint 043-2003
Michael R. Bussieck, Thomas Lindner, and Marco E. Lübbecke.
A Fast Algorithm for Near Cost Optimal Line Plans [15].


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 [16].


2006

Preprint 013-2006
Christian Liebchen and Gregor Wünsch.
The Zoo of Tree Spanner Problems [17].


vor >> [19]
------ Links: ------