Generalized Network Improvement and Packing Problems

1. Auflage 2016
ISBN: 978-3-658-16811-7
Verlag: Springer

Buch, Englisch, 213 Seiten, Format (B × H): 148 mm x 210 mm, Gewicht: 3052 g

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.

Zielgruppe

Research

Autoren/Hrsg.

Holzhauser, Michael

Fachgebiete

• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Angewandte Mathematik, Mathematische Modelle
• Mathematik | Informatik Mathematik Numerik und Wissenschaftliches Rechnen Numerische Mathematik
• Mathematik | Informatik EDV | Informatik Programmierung | Softwareentwicklung Algorithmen & Datenstrukturen
• Mathematik | Informatik EDV | Informatik Informatik Berechenbarkeitstheorie, Komplexitätstheorie

Inhaltsverzeichnis

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.

Über Autor(innen)

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.