Skip to main content

Network Flow Problems

  • Chapter
  • 3246 Accesses

Abstract

In this chapter we introduce basic properties of network flows and discuss algorithms to find maximum flows and minimum cost flows.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   37.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

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Friedr. Vieweg & Sohn Verlag

About this chapter

Cite this chapter

(2006). Network Flow Problems. In: Lineare Optimierung und Netzwerkoptimierung. Vieweg. https://doi.org/10.1007/978-3-8348-9031-3_7

Download citation

Publish with us

Policies and ethics