✦ LIBER ✦

A branch-and-bound algorithm for multi-dimensional quadratic 0–1 knapsack problems

✍ Scribed by Juan Sun; Hong-bo Sheng; Xiao-ling Sun

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch-and-bound algorithm for hard mu

✍ Alex S. Fukunaga 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 683 KB

A surrogate relaxation based algorithm f

✍ Mohamed Djerdjour; Kamlesh Mathur; Harvey M. Salkin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 530 KB

A new upper bound for the 0-1 quadratic

✍ Alain Billionnet; Alain Faye; Éric Soutif 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 120 KB

A recursive branch and bound algorithm f

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 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

An algorithm for 0-1 multiple-knapsack p

✍ Ming S. Hung; John C. Fisk 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 528 KB