A bad network problem for the simplex method and other minimum cost flow algorithms
- Cite this article as:
- Zadeh, N. Mathematical Programming (1973) 5: 255. doi:10.1007/BF01580132
- 295 Downloads
For any integern, a modified transportation problem with 2n + 2 nodes is constructed which requires 2n + 2n−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.