direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 2010

2010

Preprint 001-2010
Tobias Harks and Max Klimm.
On the Existence of Pure Nash Equilibria in Weighted Congestion Games.


Preprint 003-2010
Timo Berthold and Stefan Heinz and Marco E. Lübbecke and Rolf H. Möhring and Jens Schulz.
A Constraint Integer Programming Approach for Resource-Constrained Project Scheduling.


Preprint 008-2010
Britta Peis and Sebastian Stiller and Andreas Wiese.
Periodic packet routing on trees.


Preprint 011-2010
Martin Skutella and Jose Verschae.
A Robust PTAS for Machine Covering and Packing.


Preprint 013-2010
Britta Peis and Andreas Wiese.
Throughput maximization for periodic packet scheduling.


Preprint 016-2010
Tobias Harks and Martin Hoefer and Max Klimm and Alexander Skopalik.
Computing Pure Nash and Strong Equilibria in Bottleneck Congestion Games.


Preprint 017-2010
Tobias Harks and Max Klimm.
Congestion Games with Variable Demands.


Preprint 018-2010
Christina Büsing and Arie M. C. A. Koster and Manuel Kutschka.
Recoverable Robust Knapsacks: the Discrete Scenario Case.


Preprint 019-2010
Timo Berthold and Stefan Heinz and Jens Schulz.
An Approximative Criterion for the Potential of Energetic Reasoning.


Preprint 024-2010
Britta Peis and Andreas Wiese.
Universal packet routing with arbitrary bandwidths and transit times.


Preprint 004-2010
Eamonn T. Coughlan and Marco E. Lübbecke and Jens Schulz.
A Branch-and-Price Algorithm for Multi-Mode Resource Leveling.


Preprint 006-2010
Ronald Koch and Ebrahim Nasrabadi.
Continuous-time Dynamic Shortest Paths with Negative Transit Times.



Preprint 010-2010
Harks, Tobias and König, Felix G. and Matuschke, Jannik.
Approximation Algorithms for Capacitated Location Routing.


Preprint 014-2010
Christina Büsing and Jens Maue.
Robust Algorithms for Sorting Railway Cars.