✦ LIBER ✦

A polyhedral study of nonconvex quadratic programs with box constraints

✍ Scribed by Dieter Vandenbussche; George L. Nemhauser

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-cut algorithm for nonconvex

✍ Dieter Vandenbussche; George L. Nemhauser 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 165 KB

A note on weakly active constraints in c

✍ P.Frank Körner 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 170 KB

A new algorithm for the general quadrati

✍ Jianling Li; Peng Wang; Lin Ma 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 233 KB

A Class of Quadratic Programs with Linea

✍ Xiaojun Chen; Jane J. Ye 📂 Article 📅 2009 🏛 Springer Netherlands 🌐 English ⚖ 439 KB

A class of methods for solving large, co

✍ Eugene K. Yang; Jon W. Tolle 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 335 KB

A Dynamical Systems Analysis of Semidefi

✍ R. J. Orsi; R. E. Mahony; J. B. Moore 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 146 KB