Network Flow Problems

Robert J. Vanderbei
Additional contact information
Robert J. Vanderbei: Princeton University

Chapter Chapter 14 in Linear Programming, 2008, pp 225-252 from Springer

Abstract: Abstract Many linear programming problems can be viewed as a problem of minimizing the “transportation” cost of moving materials through a network to meet demands for material at various locations given sources of material at other locations. Such problems are called network flow problems. They form the most important special class of linear programming problems. Transportation, electric, and communication networks provide obvious examples of application areas. Less obvious, but just as important, are applications in facilities location, resource management, financial planning, and others.

Keywords: Span Tree; Tree Solution; Linear Programming Problem; Simplex Method; Dual Variable (search for similar items in EconPapers)
Date: 2008
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:isochp:978-0-387-74388-2_14

Ordering information: This item can be ordered from
http://www.springer.com/9780387743882

DOI: 10.1007/978-0-387-74388-2_14

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().