Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

Network simplex algorithm

  • Saul I. Gass
  • Carl M. Harris
Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_666

For the minimum-cost network-flow problem, a special adaptation of the simplex method that takes advantage of the mathematical structure of the network constraints to produce a computationally fast and efficient solution algorithm. The main idea behind this algorithm is the recognition that a basic feasible solution to the network problem, treated as a linear-programming problem, corresponds to a spanning tree of the defining network.  Minimum-cost network-flow problem; Network optimization;  Simplex method.

Copyright information

© Kluwer Academic Publishers 2001

Authors and Affiliations

  • Saul I. Gass
    • 1
  • Carl M. Harris
    • 2
  1. 1.Robert H. Smith School of BusinessUniversity of MarylandCollege PartUSA
  2. 2.School of Information Technology & EngineeringGeorge Mason UniversityFairfaxUSA