✦ LIBER ✦

A new upper bound for the 0-1 quadratic knapsack problem

✍ Scribed by Alain Billionnet; Alain Faye; Éric Soutif

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear programming for the 0–1 quadratic

✍ Alain Billionnet; Frédéric Calmels 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 852 KB

Lagrangean methods for the 0–1 Quadratic

✍ Philippe Michelon; Louis Veilleux 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 742 KB

A branch-and-bound algorithm for multi-d

✍ Juan Sun; Hong-bo Sheng; Xiao-ling Sun 📂 Article 📅 2007 🏛 Chinese Electronic Periodical Services 🌐 English ⚖ 163 KB

Upper bounds for the 0-1 stochastic knap

✍ Stefanie Kosuch; Abdel Lisser 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 526 KB

Upper-bounds for quadratic 0–1 maximizat

✍ E. Boros; Y. Crama; P.L. Hammer 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 428 KB

A simple 0.5-bounded greedy algorithm fo

✍ U.K. Sarkar; P.P. Chakrabarti; S. Ghose; S.C. De Sarkar 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 442 KB