direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

Preprints 2009


Preprint 031-2008
Joachim Reichel and Martin Skutella.
On the Size of Weights in Randomized Search Heuristics.

Preprint 022-2008
Martin Skutella.
An Introduction to Network Flows Over Time.


Preprint 001-2009
Höhn, Wiebke and König, Felix G. and Lübbecke, Marco E. and Möhring, Rolf H..
Sequencing and Scheduling in Coil Coating with Shuttles.

Preprint 002-2009
Fernanda Salazar and Martin Skutella.
Single-source $k$-splittable min-cost flows.

Preprint 011-2009
Tobias Harks and Max Klimm and Rolf H. Möhring.
Characterizing the Existence of Potential Functions in Weighted Congestion Games.

Preprint 014-2009
Ronald Koch and Martin Skutella.
Nash Equilibria and the Price of Anarchy for Flows Over Time.

Preprint 017-2009
Tobias Harks and Max Klimm and Rolf H. Möhring.
Strong Nash Equilibria in Games with the Lexicographical Improvement Property.

Preprint 003-2009
Britta Peis and Martin Skutella and Andreas Wiese.
Packet Routing: Complexity and Algorithms.

Preprint 006-2009
Ronald Koch and Britta Peis and Martin Skutella and Andreas Wiese.
Real-Time Message Routing and Scheduling.

Preprint 007-2009
Nikhil Bansal and Rohit Khandekar and Jochen Könemann and Viswanath Nagarajan and Britta Peis.
On Generalizations of Network Design Problems with Degree Bounds.

Preprint 008-2009
Höhn, Wiebke and Jacobs, Tobias and Megow, Nicole.
On Eulerian Extension Problems and their Application to Sequencing Problems.

Preprint 009-2009
Nicole Megow and Rolf H. Möhring and Jens Schulz.
Decision Support and Optimization in Shutdown and Turnaround Scheduling.

Preprint 012-2009
Britta Peis and Martin Skutella and Andreas Wiese.
Packet Routing on the Grid.

Preprint 016-2009
Ronald Koch and Ebrahim Nasrabadi and Martin Skutella.
Continuous and Discrete Flows Over Time: A General Model Based on Measure Theory.

Preprint 020-2009
Günther, Elisabeth and König, Felix G. and Megow, Nicole.
Scheduling and Packing Malleable Tasks with Precedence Constraints of Bounded Width.