Skip to main content
SpringerLink
Log in
Book cover

Generalized Network Improvement and Packing Problems

  • Book
  • © 2016

Overview

Authors:
  1. Michael Holzhauser

    1. Department of Mathematics, Technische Universität Kaiserslautern Department of Mathematics, Kaiserslautern, Germany

    View author publications

    You can also search for this author in PubMed   Google Scholar

  • A mathematical study

  • Includes supplementary material: sn.pub/extras

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (8 chapters)

  1. Front Matter

    Pages I-XVI
    Download chapter 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
    Download chapter PDF
Back to top

Keywords

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.

Authors and Affiliations

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

    Michael Holzhauser

About 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. 

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation