✦ LIBER ✦

A class of polynomially solvable 0–1 programming problems and an application

✍ Scribed by Miao Wang; JinXing Xie; HuaChun Xiong

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

An improved linearization technique for

✍ Xiaozheng He; Anthony Chen; Wanpracha A. Chaovalitwongse; Henry X. Liu 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 182 KB

Complexity of a particular class of sing

✍ R. Kapoor; S. R. Arora 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 564 KB

A convex class of polynomials and an ass

✍ Louis Brickman 📂 Article 📅 1962 🏛 Elsevier Science 🌐 English ⚖ 180 KB

Duality for A class of improper linear p

✍ F. Mirzoakhmedov; L. I. Mosheev 📂 Article 📅 1991 🏛 Springer US 🌐 English ⚖ 408 KB

Successive approximation technique for a

✍ Z. Q. Zuo; C. P. Wu 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 587 KB