✦ LIBER ✦

A note on the strong polynomiality of convex quadratic programming

✍ Scribed by Sung-Pil Hong; Sushil Verma

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The polynomial solvability of convex qua

✍ M.K. Kozlov; S.P. Tarasov; L.G. Khachiyan 📂 Article 📅 1980 🏛 Elsevier Science ⚖ 336 KB

A new bound for the quadratic assignment

✍ Kurt M. Anstreicher; Nathan W. Brixius 📂 Article 📅 2001 🏛 Springer-Verlag 🌐 English ⚖ 114 KB

Towards a strongly polynomial algorithm

✍ Frieda Granot; Jadranka Skorin-Kapov 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 538 KB

On the convergence of Han's method for c

✍ Alfredo N. Iusem; Alvaro R. De Pierro 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 813 KB

A note on an implementation of a method

✍ R. Hettich; G. Gramlich 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 217 KB

A generalized design approach to solutio

✍ J.F. Brotchie 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 694 KB