✦ LIBER ✦

A hybrid dynamic programming/branch-and-bound algorithm for the multiple-choice knapsack problem

✍ Scribed by M.E. Dyer; W.O. Riha; J. Walker

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for solving

✍ M.E. Dyer; N. Kayal; J. Walker 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 865 KB

A branch-and-bound algorithm for hard mu

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

A dynamic programming algorithm for the

✍ Luce Brotcorne; Saïd Hanafi; Raïd Mansi 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 940 KB

A recursive branch and bound algorithm f

✍ Arne Thesen 📂 Article 📅 1975 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

A minimal algorithm for the multiple-cho

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1017 KB

A Bound and Bound algorithm for the zero

✍ Silvano Martello; Paolo Toth 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 791 KB