✦ LIBER ✦

A solvable case of quadratic 0–1 programming

✍ Scribed by Francisco Barahona

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Polynomially solvable cases of the const

✍ Eranda Çela; Bettina Klinz; Christophe Meyer 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 331 KB

A Tight Lower Bound for a Special Case o

✍ G. Palubeckis 📂 Article 📅 2006 🏛 Springer Vienna 🌐 English ⚖ 185 KB

Quadratic convex reformulations for quad

✍ Marie-Christine Plateau 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 132 KB

Experiments in quadratic 0–1 programming

✍ F. Barahona; M. Jünger; G. Reinelt 📂 Article 📅 1989 🏛 Springer-Verlag 🌐 English ⚖ 498 KB

The polynomial solvability of convex qua

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

On Solvability of Convex Noncoercive Qua

✍ Z. Dostál 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 216 KB