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 | |
Publication status | Published - 2004 Jan |
Externally published | Yes |
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