direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints

2000

Preprint 684-2000
Han Hoogeveen and Martin Skutella and Gerhard J. Woeginger.
Preemptive scheduling with rejection.


Preprint 692-2000
Cornelia Kober and Matthias Müller-Hannemann.
Hexahedral Mesh Generation for the Simulation of the Human Mandible.


Preprint 704-2000
Ekkehard Köhler.
AT-free, coAT-free Graphs and AT-free Posets.


Preprint 705-2000
Ekkehard Köhler.
Recognizing Graphs without Asteroidal Triples.




Preprint 664-2000
Rolf H. Möhring and Andreas S. Schulz and Frederik Stork and Marc Uetz.
On Project Scheduling with Irregular Starting Time Costs.


Preprint 680-2000
Rolf H. Möhring and Andreas S. Schulz and Frederik Stork and Marc Uetz.
Solving Project Scheduling Problems by Minimum Cut Computations.


Preprint 689-2000
Rolf H. Möhring and Martin Skutella and Frederik Stork.
Scheduling with AND/OR precedence constraints.


Preprint 682-2000
Rolf H. Möhring and Marc Uetz.
Scheduling Scarce Resources in Chemical Engineering.


Preprint 668-2000
Matthias Müller-Hannemann.
Improving the Surface Cycle Structure for Hexahedral Mesh Generation.


Preprint 669-2000
Michael Naatz.
A Note on a Question of C. D. Savage.







Preprint 693-2000
Frederik Stork and Marc Uetz.
On the Representation of Resource Constraints in Project Scheduling.


1999

Preprint -1999
Afrati, Foto and Bampis, Evripidis and Chekuri, Chandra and Karger, David and Kenyon, Claire and Khanna, Sanjeev and Milis, Ioannis and Queyranne, Maurice and Skutella, Martin and Stein, Cliff and Sviridenko, Maxim.
Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.


Preprint 654-1999
Goemans, Michel X. and Queyranne, Maurice and Schulz, Andreas S. and Skutella, Martin and Wang, Yaoguang.
Single Machine Scheduling with Release Dates.


Preprint 655-1999
Goemans, Michel X. and Skutella, Martin.
Cooperative facility location games.


Preprint 658-1999
Olaf Jahn and Rolf H. Möhring and Andreas S. Schulz.
Optimal Routing of Traffic Flows with Length Restrictions in Networks with Congestion.



Preprint 646-1999
Rolf H. Möhring and Martin Skutella and Frederik Stork.
Forcing Relations for AND/OR Precedence Constraints.


Preprint 632-1999
Müller-Hannemann, Matthias.
Shelling Hexahedral Complexes for Mesh Generation.


Preprint 631-1999
Müller-Hannemann, Matthias and Schwartz, Alexander.
Implementing Weighted b-Matching Algorithms: Insights from a Computational Study.


Preprint 633-1999
Müller-Hannemann, Matthias and Weihe, Karsten.
On the Discrete Core of Quadrilateral Mesh Refinement.


Preprint 639-1999
Schulz, Andreas S. and Skutella, Martin.
The Power of α–Points in Preemptive Single Machine Scheduling.


Preprint 653-1999
Schulz, Andreas S. and Skutella, Martin.
Scheduling unrelated machines by randomized rounding.



Preprint 628-1999
Martin Skutella and Gerhard J. Woeginger.
A PTAS for minimizing the total weighted completion time on identical parallel machines.


Preprint 634-1999
Weihe, Karsten and Brandes, Ulrik and Liebers, Annegret and Müller-Hannemann, Matthias and Wagner, Dorothea and Willhalm, Thomas.
Empirical Design of Geometric Algorithms.


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.


Preprint 617-1998
Andreas S. Schulz and Robert Weismantel.
An Oracle-Polynomial Time Augmentation Algorithm for Integer Proramming.


Preprint 577-1998
Skutella, Martin.
Semidefinite Relaxations for Parallel Machine Scheduling.