✦ LIBER ✦

A best first search exact algorithm for the Multiple-choice Multidimensional Knapsack Problem

✍ Scribed by Abdelkader Sbihi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minimal algorithm for the multiple-cho

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

A fast algorithm for the linear multiple

✍ Krzysztof Dudziński; Stanisław Walukiewicz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 256 KB

A branch and bound algorithm for solving

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

A heuristic algorithm for the multidimen

✍ M.J. Magazine; Osman Oguz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 488 KB

A successive approximation algorithm for

✍ Zhenbo Wang; Wenxun Xing 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 420 KB

A recursive branch and bound algorithm f

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