✦ LIBER ✦

An O(n) algorithm for the linear multiple choice knapsack problem and related problems

✍ Scribed by Eitan Zemel

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

An O(n) algorithm for the multiple-choic

✍ M. E. Dyer 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 286 KB

A fast algorithm for the linear multiple

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

An O(n) algorithm for quadratic knapsack

✍ Peter Brucker 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 137 KB

A minimal algorithm for the multiple-cho

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

A branch and bound algorithm for solving

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

A best first search exact algorithm for

✍ Abdelkader Sbihi 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 348 KB