✦ LIBER ✦

A fast algorithm for the linear multiple-choice knapsack problem

✍ Scribed by Krzysztof Dudziński; Stanisław Walukiewicz

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

The linear multiple choice knapsack prob

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

A branch and bound algorithm for solving

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

A linear-time algorithm for solving cont

✍ Takahito Kuno; Hiroshi Konno; Eitan Zemel 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 221 KB

A hypercube algorithm for the 0/1 Knapsa

✍ Jong Lee; Eugene Shragowitz; Sartaj Sahni 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 878 KB

A heuristic algorithm for the multidimen

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