direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints 1998

1998

Preprint 616-1998
Alexander Bockmayr and Friedrich Eisenbrand and Mark Hartmann and Andreas S. Schulz.
On the Chvátal Rank of Polytopes in the 0/1 Cube.



Preprint 618-1998
Friedrich Eisenbrand and Andreas S. Schulz.
Bounds on the Chvátal Rank of Polytopes in the 0/1-Cube.


Preprint 590-1998
Felsner, Stefan and Gustedt, Jens and Morvan, Michel.
Interval Reductions and Extensions of Orders: Bijections to Chains in Lattices.


Preprint 596-1998
Andreas Fest and Rolf H. Möhring and Frederik Stork and Marc Uetz.
Resource constrained project scheduling with time windows: A branching scheme based on dynamic release dates.



Preprint 615-1998
Ekkehard Köhler and Matthias Kriesell.
Edge-Dominating Trails in AT-free Graphs.


Preprint 609-1998
Arfst Ludwig and Rolf H. Möhring and Frederik Stork.
A computational study on bounding the makespan distribution in stochastic project networks.


Preprint 584-1998
Munier, Alix and Queyranne, Maurice and Schulz, Andreas S..
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems.


Preprint 619-1998
Rolf H. Möhring and Martin Oellrich and Andreas S. Schulz.
Efficient Algorithms for the Minimum-Cost Embedding of Reliable Virtual Private Networks into Telecommunication Networks.


Preprint 620-1998
Rolf H. Möhring and Andreas S. Schulz and Frederik Stork and Marc Uetz.
Resource Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems.


Preprint 595-1998
Rolf H. Möhring and Andreas S. Schulz and Marc Uetz.
Approximation in stochastic scheduling: The power of LP-based priority policies.


Preprint 611-1998
Rolf H. Möhring and Markus W. Schäffter.
Scheduling Series-Parallel Orders Subject to 0/1-Communication Delays.


Preprint 612-1998
Rolf H. Möhring and Frederik Stork.
Linear preselective policies for stochastic project scheduling.


Preprint 591-1998
Müller-Hannemann, Matthias and Schwartz, Alexander.
Implementing Weighted b-Matching Algorithms: Towards a Flexible Software Design.