✦ LIBER ✦

An O(n) algorithm for quadratic knapsack problems

✍ Scribed by Peter Brucker

Book ID: 107917070
Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 137 KB
Volume: 3
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(84)90010-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Breakpoint searching algorithms for the

Breakpoint searching algorithms for the continuous quadratic knapsack problem

✍ Krzysztof C. Kiwiel 📂 Article 📅 2006 🏛 Springer-Verlag 🌐 English ⚖ 425 KB

Variable Fixing Algorithms for the Conti

Variable Fixing Algorithms for the Continuous Quadratic Knapsack Problem

✍ K. C. Kiwiel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 364 KB

An O(n) algorithm for the linear multipl

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

✍ Eitan Zemel 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 496 KB

On Linear-Time Algorithms for the Contin

On Linear-Time Algorithms for the Continuous Quadratic Knapsack Problem

✍ K. C. Kiwiel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 208 KB

An exact algorithm for large unbounded k

An exact algorithm for large unbounded knapsack problems

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

An exact algorithm for large multiple kn

An exact algorithm for large multiple knapsack problems

✍ David Pisinger 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 137 KB

The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total pro®t sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as ®nancial ma