Generalized Network Improvement and Packing Problems

  • Michael¬†Holzhauser

Table of contents

  1. Front Matter
    Pages I-XVI
  2. Michael Holzhauser
    Pages 1-4
  3. Michael Holzhauser
    Pages 5-18
  4. Michael Holzhauser
    Pages 117-153
  5. Michael Holzhauser
    Pages 155-191
  6. Michael Holzhauser
    Pages 193-194
  7. Back Matter
    Pages 195-213

About this book


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.

  • 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
Target Groups
  • Researchers and students in the fields of mathematics, computer science, and economics
  • Practitioners in operations research and logistics
The Author
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.


Computational Complexity Approximability Fractional Packing Maximum Flow Problems Minimum Cost Flow Problems

Authors and affiliations

  • Michael¬†Holzhauser
    • 1
  1. 1.Department of MathematicsTechnische Universität Kaiserslautern Department of MathematicsKaiserslauternGermany

Bibliographic information

Industry Sectors
Finance, Business & Banking