✦ LIBER ✦

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

✍ Scribed by Akiyoshi Shioura

Book ID: 108410491
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 188 KB
Volume: 32
Category: Article
ISSN: 0167-6377
DOI: 10.1016/s0167-6377(03)00070-1

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A strongly polynomial algorithm for the

A strongly polynomial algorithm for the uniform balanced network flow problem

✍ Maria Grazia Scutellá 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 565 KB

## Several balanced optimization problems have been analysed in the literature. Here, the balanced network flow problem in the uniform case is studied, and it is shown that it can be solved by the Newton's approach in O(n' log3 n) max-flow computations. The key of the proof is an extension of Rad

The value iteration algorithm is not str

The value iteration algorithm is not strongly polynomial for discounted dynamic programming

✍ Feinberg, Eugene A.; Huang, Jefferson 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 328 KB

On strongly polynomial variants of the n

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 324 KB