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

Akiyoshi Shioura

doi:10.1016/S0167-6377(03)00070-1

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

Akiyoshi Shioura

INF - System Information Sciences

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	31-35
Number of pages	5
Journal	Operations Research Letters
Volume	32
Issue number	1
DOIs	https://doi.org/10.1016/S0167-6377(03)00070-1
Publication status	Published - 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

Access to Document

10.1016/S0167-6377(03)00070-1

Cite this

@article{d8194699ec14454ca3b5cf3f7ae9fa3f,

title = "The MA-ordering max-flow algorithm is not strongly polynomial for directed networks",

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.",

keywords = "MA ordering, Maximum flow, Strongly polynomial, Weakly polynomial",

author = "Akiyoshi Shioura",

note = "Funding Information: The author thanks Satoru Fujishige and Shigueo Isotani for their comments on this manuscript. This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan. ",

year = "2004",

month = jan,

doi = "10.1016/S0167-6377(03)00070-1",

language = "English",

volume = "32",

pages = "31--35",

journal = "Operations Research Letters",

issn = "0167-6377",

publisher = "Elsevier",

number = "1",

}

TY - JOUR

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

AU - Shioura, Akiyoshi

N1 - Funding Information: The author thanks Satoru Fujishige and Shigueo Isotani for their comments on this manuscript. This work is supported by Grant-in-Aid of the Ministry of Education, Culture, Sports, Science and Technology of Japan.

PY - 2004/1

Y1 - 2004/1

N2 - 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.

AB - 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.

KW - MA ordering

KW - Maximum flow

KW - Strongly polynomial

KW - Weakly polynomial

UR - http://www.scopus.com/inward/record.url?scp=0142029548&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0142029548&partnerID=8YFLogxK

U2 - 10.1016/S0167-6377(03)00070-1

DO - 10.1016/S0167-6377(03)00070-1

M3 - Article

AN - SCOPUS:0142029548

VL - 32

SP - 31

EP - 35

JO - Operations Research Letters

JF - Operations Research Letters

SN - 0167-6377

IS - 1

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this