Generalized Network Improvement and Packing Problems

Michael Holzhauser (Autor)

Buch | Softcover

XVI, 213 Seiten

2017 | 1st ed. 2016
Springer Fachmedien Wiesbaden GmbH (Verlag)
978-3-658-16811-7 (ISBN)

Artikel merken

Michael Holzhauser discusses generalizations of well-known network flow and packing problems by additional or modified side constraints. By exploiting the inherent connection between the two problem classes, the author investigates the complexity and approximability of several novel network flow and packing problems and presents combinatorial solution and approximation algorithms.

Dr. Michael Holzhauser studied computer science at the University of Kaiserslautern and is now a research fellow in the Optimization Research Group at the Department of Mathematics of the University of Kaiserslautern.

Fractional Packing and Parametric Search Frameworks.- Budget-Constrained Minimum Cost Flows: The Continuous Case.- Budget-Constrained Minimum Cost Flows: The Discrete Case.- Generalized Processing Networks.- Convex Generalized Flows.

Erscheinungsdatum	28.01.2017
Zusatzinfo	XVI, 213 p. 26 illus.
Verlagsort	Wiesbaden
Sprache	englisch
Maße	148 x 210 mm
Themenwelt	Informatik ► Theorie / Studium ► Algorithmen
	Mathematik / Informatik ► Mathematik ► Analysis
	Mathematik / Informatik ► Mathematik ► Angewandte Mathematik
Schlagworte	Algorithmic Complexity • algorithms • approximability • Computational Complexity • Discrete Optimization • Fractional Packing • Mathematical Modelling • Mathematics • mathematics and statistics • Mathematics of Algorithmic Complexity • Maximum Flow Problems • Minimum Cost Flow Problems • Numerical analysis • Optimization
ISBN-10	3-658-16811-0 / 3658168110
ISBN-13	978-3-658-16811-7 / 9783658168117
Zustand	Neuware