direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints

2005

Preprint 003-2005
Nicole Megow and Marc Uetz and Tjark Vredeveld.
Models and Algorithms for Stochastic Online Scheduling.


Preprint 007-2005
Gabriele Di Stefano and Stefan Krause and Marco E. Lübbecke and Uwe T. Zimmermann.
On Minimum Monotone and Unimodal Partitions of Permutations.


2004

Preprint 035-2004
Alex Hall and Heiko Schilling.
Flows over Time: Towards a more Realistic and Computationally Tractable Model.


Preprint 037-2004
Laura Heinrich-Litan and Marco E. L\übbecke.
Rectangle Covers Revisited Computationally.


Preprint 042-2004
Ekkehard K\öhler and Rolf H. M\öhring and Heiko Schilling.
Acceleration of Shortest Path and Constrained Shortest Path Computation.


Preprint 027-2004
Ekkehard K\öhler and Rolf H. M\öhring and Gregor W\ünsch.
Minimizing Total Delay in Fixed-Time Controlled Traffic Networks.


Preprint 019-2004
Ronald Koch and Martin Skutella and Ines Spenke.
Approximation and complexity of k-splittable flows.


Preprint 008-2004
Marco E. L\übbecke and Jacques Desrosiers.
Selected Topics in Column Generation.


Preprint 009-2004
Marco E. L\übbecke and Uwe T. Zimmermann.
Shunting Minimal Rail Car Allocation.


Preprint 020-2004
Christian Liebchen and Rolf H. M\öhring.
The Modeling Power of the Periodic Event Scheduling Problem: Railway Timetables - and Beyond.


Preprint 021-2004
Christian Liebchen and Mark Proksch and Frank H. Wagner.
Performance of Algorithms for Periodic Timetable Optimization.


Preprint 031-2004
Christian Liebchen and Romeo Rizzi.
A Greedy Approach to Compute a Minimum Cycle Bases of a Directed Graph.


Preprint 026-2004
Rolf H. M\öhring and Ekkehard K\öhler and Ewgenij Gawrilow and Bj\örn Stenzel.
Conflict-free Real-time AGV Routing.


Preprint 018-2004
Nicole Megow and Marc Uetz and Tjark Vredeveld.
Stochastic Online Scheduling on Parallel Machines.


2003

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 023-2003
Sven O. Krumke and Nicole Megow and Tjark Vredeveld.
How to Whack Moles.



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.


2002

Preprint 739-2002
Georg Baier and Ekkehard Köhler and Martin Skutella.
On the $k$-splittable Flow Problem.


Preprint 728-2002
Lisa Fleischer and Martin Skutella.
The Quickest Multicommodity Flow Problem.


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


Preprint 754-2002
Olaf Jahn and Rolf H. Möhring and Andreas S. Schulz and Nicolas E. Stier Moses.
System Optimal Routing of Traffic Flows with User Constraints in Networks with Congestion.


Preprint 762-2002
Ekkehard Köhler and Katharina Langkau and Martin Skutella.
Time-Expanded Graphs for Flow-Dependent Transit Times.


Preprint 752-2002
Ekkehard Köhler and Rolf H. Möhring and Martin Skutella.
Traffic Networks and Flows Over Time.


Preprint 736-2002
Christian Liebchen and Rolf H. Möhring.
A Case Study in Periodic Timetabling.


Preprint 761-2002
Christian Liebchen and Leon Peeters.
On Cyclic Timetabling and Cycles in Graphs.


Preprint 734-2002
Martin Skutella.
List scheduling in order of α-points on a single machine.


Preprint 756-2002
Martin Skutella and Marc Uetz.
Stochastic Machine Scheduling with Precedence Constraints.


2001

Preprint 710-2001
Esther M. Arkin and Sándor P. Fekete and Joseph S. B. Mitchell.
Algorithms for Manufacturing Paperclips and Sheet M et al. Structures.


Preprint 711-2001
Esther M. Arkin and Michael A. Bender and Sándor P. Fekete and Joseph S. B. Mitchell and Martin Skutella.
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots.


Preprint 712-2001
Ekkehard Köhler and Martin Skutella.
Flows over time with load-dependent transit times.


Preprint 716-2001
Christian Liebchen.
The Periodic Assignment Problem (PAP) May Be Solved Greedily.


Preprint 723-2001
Berit Johannes.
Scheduling Parallel Jobs to Minimize Makespan.


2000

Preprint 674-2000
Esther M. Arkin and Michael A. Bender and Erik D. Demaine and Sándor P. Fekete and Joseph S. B. Mitchell and Saurabh Sethia.
Optimal Covering Tours with Turn Costs.


Preprint 694-2000
Esther M. Arkin and Sándor P. Fekete and Ferran Hurtado and Joseph S. B. Mitchell and Marc Noy and Vera Sacristán and Saurabh Sethia.
On the Reflexivity of Point Sets.


Preprint 696-2000
Sándor P. Fekete and Ekkehard Köhler and Jürgen Teich.
Optimal FPGA Module Placement with Temporal Precedence Constraints.


Preprint 697-2000
Sándor P. Fekete and Ekkehard Köhler and Jürgen Teich.
Extending partial suborders and implication classes.


Preprint 698-2000
Sándor P. Fekete and Ekkehard Köhler and Jürgen Teich.
More-Dimensional Packing with Order Constraints.


Preprint 667-2000
Sándor P. Fekete and Henk Meijer.
Maximum dispersion and geometric maximum weight cliques.


Preprint 695-2000
Sándor P. Fekete and Henk Meijer and André Rohe and Walter Tietze.
Solving a ``Hard'' Problem to Approximate an ``Easy'' One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.


Preprint 666-2000
Sándor P. Fekete and Joseph S. B. Mitchell and Karin Weinbrecht.
On the continuous Weber and k-median problems.