✦ LIBER ✦

A branch-and-bound algorithm for hard multiple knapsack problems

✍ Scribed by Alex S. Fukunaga

Publisher: Springer US
Year: 2009
Tongue: English
Weight: 683 KB
Volume: 184
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-009-0660-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for solving

A branch and bound algorithm for solving the multiple-choice knapsack problem

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

A recursive branch and bound algorithm f

A recursive branch and bound algorithm for the multidimensional knapsack problem

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

A Bound and Bound algorithm for the zero

A Bound and Bound algorithm for the zero-one multiple knapsack problem

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

An upper bound for the zero-one knapsack

An upper bound for the zero-one knapsack problem and a branch and bound algorithm

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

Computational results with a branch-and-

Computational results with a branch-and-bound algorithm for the general knapsack problem

✍ R. L. Bulfin; R. G. Parker; C. M. Shetty 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 416 KB 👁 1 views

The critical-item, upper bounds, and a b

The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem

✍ Shaw, Dong X.; Cho, Geon 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB 👁 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac