Generalized Network Improvement and Packing Problems

1. Front Matter

   Pages I-XVI

   PDF

2. Introduction

   • Michael Holzhauser

   Pages 1-4

3. Preliminaries

   • Michael Holzhauser

   Pages 5-18

4. Fractional Packing and Parametric Search Frameworks

   • Michael Holzhauser

   Pages 19-37

5. Budget-Constrained Minimum Cost Flows: The Continuous Case

   • Michael Holzhauser

   Pages 39-76

6. Budget-Constrained Minimum Cost Flows: The Discrete Case

   • Michael Holzhauser

   Pages 77-115

7. Generalized Processing Networks

   • Michael Holzhauser

   Pages 117-153

8. Convex Generalized Flows

   • Michael Holzhauser

   Pages 155-191

9. Conclusion

   • Michael Holzhauser

   Pages 193-194

10. Back Matter

    Pages 195-213

    PDF

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.

• Computational Complexity
• Approximability
• Fractional Packing
• Maximum Flow Problems
• Minimum Cost Flow Problems
• algorithmic complexity

• Department of Mathematics, Technische Universität Kaiserslautern Department of Mathematics, Kaiserslautern, Germany

  Michael Holzhauser

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. 

Policies and ethics