✦ LIBER ✦

A minimal algorithm for the multiple-choice knapsack problem

✍ Scribed by David Pisinger

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The linear multiple choice knapsack prob

✍ Sanjiv Sarin; Mark H. Karwan 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 372 KB

The knapsack problem with disjoint multi

✍ Vijay Aggarwal; Narsingh Deo; Dilip Sarkar 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 750 KB

The 0–1 knapsack problem with multiple c

✍ Robert M. Nauss 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 787 KB

An algorithm for 0-1 multiple-knapsack p

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