A bad network problem for the simplex method and other minimum cost flow algorithms
- Norman ZadehAffiliated withIBM Thomas J. Watson Research Center
Rent the article at a discountRent now
* Final gross prices may vary according to local VAT.Get Access
For any integern, a modified transportation problem with 2n + 2 nodes is constructed which requires 2 n + 2 n−2−2 iterations using all but one of the most commonly used minimum cost flow algorithms.
As a result, the Edmonds—Karp Scaling Method  becomes the only known “good” (in the sense of Edmonds) algorithm for computing minimum cost flows.
- A bad network problem for the simplex method and other minimum cost flow algorithms
Volume 5, Issue 1 , pp 255-266
- Cover Date
- Print ISSN
- Online ISSN
- Additional Links
- Industry Sectors
- Norman Zadeh (1)
- Author Affiliations
- 1. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA