Network simplex algorithm

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.