Algorithms and complexity results for packing and covering problems and robust dynamic network flows under primal-dual aspects

to related objects

Alternative title: Algorithmen und Komplexitätsresultate für Packungs- und Überdeckungsprobleme sowie für Robuste Dynamische Netzwerkfluss Probleme unter Primal-Dualen Aspekten

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Notes: RWTH Aachen University, Dissertation, 2018

Keyword: Algorithms
Mathematical optimization

Event: Veröffentlichung

(where): Aachen

(who): Universitätsbibliothek der RWTH Aachen

(when): 2018

Creator: Wierz, Andreas

Contributor: Peis, Britta
Koster, Arie Marinus
Skutella, Martin

DOI: 10.18154/RWTH-2018-222629

URN: urn:nbn:de:101:1-2019110811415831379836

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 15.08.2025, 7:33 AM CEST

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Wierz, Andreas
Peis, Britta
Koster, Arie Marinus
Skutella, Martin
Universitätsbibliothek der RWTH Aachen

Time of origin

2018

Other Objects (12)

A Robust PTAS for Machine Covering and Packing

Flows with Unit Path Capacities and Related Packing and Covering Problems

Convex quadratic and semidefinite programming relaxations in Scheduling

Aufsatz

Der altsprachliche Unterricht und die Aufgabe der Gegenwart

Editorial

Zocken um Zimt- und Zucker-Plätzchen

Approximating the single source unsplittable min-cost flow problem

Editorial

A Robust PTAS for Machine Covering and Packing

Flows with Unit Path Capacities and Related Packing and Covering Problems

Convex quadratic and semidefinite programming relaxations in Scheduling

Aufsatz

Der altsprachliche Unterricht und die Aufgabe der Gegenwart

Editorial

Zocken um Zimt- und Zucker-Plätzchen

Approximating the single source unsplittable min-cost flow problem

Editorial

A Robust PTAS for Machine Covering and Packing

Flows with Unit Path Capacities and Related Packing and Covering Problems

Convex quadratic and semidefinite programming relaxations in Scheduling

Aufsatz

Der altsprachliche Unterricht und die Aufgabe der Gegenwart

Editorial

Zocken um Zimt- und Zucker-Plätzchen

Approximating the single source unsplittable min-cost flow problem

Editorial

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Algorithms and complexity results for packing and covering problems and robust dynamic network flows under primal-dual aspects

Object Details

Classification and Topics

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

A Robust PTAS for Machine Covering and Packing

Flows with Unit Path Capacities and Related Packing and Covering Problems

Convex quadratic and semidefinite programming relaxations in Scheduling

Der altsprachliche Unterricht und die Aufgabe der Gegenwart

Editorial

Zocken um Zimt- und Zucker-Plätzchen

Approximating the single source unsplittable min-cost flow problem

Editorial

Editorial

Editorial

Editorial

Editorial

A Robust PTAS for Machine Covering and Packing

Flows with Unit Path Capacities and Related Packing and Covering Problems

Convex quadratic and semidefinite programming relaxations in Scheduling

Der altsprachliche Unterricht und die Aufgabe der Gegenwart

Editorial

Zocken um Zimt- und Zucker-Plätzchen

Approximating the single source unsplittable min-cost flow problem

Editorial

Editorial

Editorial

Editorial

Editorial

A Robust PTAS for Machine Covering and Packing

Flows with Unit Path Capacities and Related Packing and Covering Problems

Convex quadratic and semidefinite programming relaxations in Scheduling

Der altsprachliche Unterricht und die Aufgabe der Gegenwart

Editorial

Zocken um Zimt- und Zucker-Plätzchen

Approximating the single source unsplittable min-cost flow problem

Editorial

Editorial

Editorial

Editorial

Editorial

Related objects

Reset password