✦ LIBER ✦

Polynomial algorithms for a class of minimum rank-two cost path problems

✍ Scribed by Takahito Kuno

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for minimum quadr

✍ M. Minoux 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 739 KB

A polynomial time algorithm for obtainin

✍ Shin-ichi Nakayama; Shigeru Masuyama 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 161 KB

A class of rank-two ellipsoid algorithms

✍ A. Ech-Cherif; J. G. Ecker 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 619 KB

Polynomial Algorithms for a Two-Class Mu

✍ Paolo Detti; Alessandro Agnetis; Gianfranco Ciaschetti 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 421 KB

A path following algorithm for a class o

✍ J. Zhu 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 653 KB

Algorithms of polynomial complexity for

✍ E.N. Gordeyev 📂 Article 📅 1987 🏛 Elsevier Science ⚖ 481 KB