✦ LIBER ✦

On Complexity of the Translational-Cut Algorithm for Convex Minimax Problems

✍ Scribed by K. A. Ariyawansa; P. L. Jiang

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the exchange algori

✍ Zvi Drezner 📂 Article 📅 1987 🏛 Springer-Verlag 🌐 English ⚖ 171 KB

A central cutting plane algorithm for th

✍ Jack Elzinga; Thomas G. Moore 📂 Article 📅 1975 🏛 Springer-Verlag 🌐 English ⚖ 496 KB

On the need for special purpose algorith

✍ E. R. Panier 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 481 KB

On the complexity of algorithms for the

✍ A. G. Akritas; S. D. Danielopoulos 📂 Article 📅 1980 🏛 Springer Vienna 🌐 English ⚖ 444 KB

A Polynomial Cutting Surfaces Algorithm

✍ Zhi-Quan Luo; Jie Sun 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 119 KB

A polynomial algorithm for one problem o

✍ M.Z. Arslanov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 170 KB