The MA-ordering max-flow algorithm is not strongly polynomial for directed networks

Akiyoshi Shioura

Research output: Contribution to journalArticlepeer-review

4 Citations (Scopus)

Abstract

The maximum adjacency-ordering max-flow algorithm was reviewed. It was shown that the algorithm was not strongly polynomial by giving a real-valued instance for which the algorithm does not terminate. The fact that a strongly polynomial algorithm terminated in finite time even for instances with irrational data was used.

Original languageEnglish
Pages (from-to)31-35
Number of pages5
JournalOperations Research Letters
Volume32
Issue number1
DOIs
Publication statusPublished - 2004 Jan

Keywords

  • MA ordering
  • Maximum flow
  • Strongly polynomial
  • Weakly polynomial

ASJC Scopus subject areas

  • Software
  • Management Science and Operations Research
  • Industrial and Manufacturing Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'The MA-ordering max-flow algorithm is not strongly polynomial for directed networks'. Together they form a unique fingerprint.

Cite this