Find out how to access previewonly content
, Volume 5, Issue 1, pp 255266
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 discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
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 [3] becomes the only known “good” (in the sense of Edmonds) algorithm for computing minimum cost flows.
 Title
 A bad network problem for the simplex method and other minimum cost flow algorithms
 Journal

Mathematical Programming
Volume 5, Issue 1 , pp 255266
 Cover Date
 197312
 DOI
 10.1007/BF01580132
 Print ISSN
 00255610
 Online ISSN
 14364646
 Publisher
 SpringerVerlag
 Additional Links
 Topics
 Industry Sectors
 Authors

 Norman Zadeh ^{(1)}
 Author Affiliations

 1. IBM Thomas J. Watson Research Center, Yorktown Heights, New York, USA