✦ LIBER ✦

A polynomial-time simplex method for the maximumk-flow problem

✍ Scribed by Donald K. Wagner; Hong Wan

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomial-time primal simplex algorithm

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 882 KB

A strongly polynomial simplex method for

✍ Santosh N. Kabadi; Abraham P. Punnen 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 339 KB

Computational experience with a polynomi

✍ Yoshiro Ikura; George L. Nemhauser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 572 KB

A simple method for improving the primal

✍ Agustín Bompadre; James B. Orlin 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 346 KB

A polynomial-time simplex type method fo

✍ L. M. Brégman 📂 Article 📅 1990 🏛 Springer US 🌐 English ⚖ 399 KB

A new polynomial time method for a linea

✍ Shinji Mizuno 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 515 KB