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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Kluwer Academic Publishers
About this entry
Cite this entry
Gass, S.I., Harris, C.M. (2001). Network simplex algorithm. In: Gass, S.I., Harris, C.M. (eds) Encyclopedia of Operations Research and Management Science. Springer, New York, NY. https://doi.org/10.1007/1-4020-0611-X_666
Download citation
DOI: https://doi.org/10.1007/1-4020-0611-X_666
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-7923-7827-3
Online ISBN: 978-1-4020-0611-1
eBook Packages: Springer Book Archive