Mathematical Programming

, Volume 5, Issue 1, pp 255–266

A bad network problem for the simplex method and other minimum cost flow algorithms

  • Norman Zadeh
Article

DOI: 10.1007/BF01580132

Cite this article as:
Zadeh, N. Mathematical Programming (1973) 5: 255. doi:10.1007/BF01580132

Abstract

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 [3] becomes the only known “good” (in the sense of Edmonds) algorithm for computing minimum cost flows.

Copyright information

© The Mathematical Programming Society 1973

Authors and Affiliations

  • Norman Zadeh
    • 1
  1. 1.IBM Thomas J. Watson Research CenterYorktown HeightsUSA