Minimum Cost Network Flow Algorithms

Jeffery L. Kennington () and Richard V. Helgason ()
Additional contact information
Jeffery L. Kennington: Southern Methodist University
Richard V. Helgason: Southern Methodist University

Chapter 6 in Handbook of Optimization in Telecommunications, 2006, pp 147-162 from Springer

Abstract: Abstract The minimal cost network flow model is defined along with optimality criteria and three efficient procedures for obtaining an optimal solution. Primal and dual network simplex methods are specializations of well-known algorithms for linear programs. The primal procedure maintains primal feasibility at each iteration and seeks to simultaneously achieve dual feasibility, The dual procedure maintains dual feasibility and moves toward primal feasibility. All operations for both algorithms can be performed on a graphical structure called a tree. The scaling push-relabel method is designed exclusively for optimization problems on a network. Neither primal nor dual feasibility is achieved until the final iteration.

Keywords: Networks-graphs flow algorithms; integer programming algorithms; linear programming algorithms; linear programming simplex algorithms (search for similar items in EconPapers)
Date: 2006
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:sprchp:978-0-387-30165-5_6

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

DOI: 10.1007/978-0-387-30165-5_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().