✦ LIBER ✦

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

✍ Scribed by M.E. Dyer; N. Kayal; J. Walker

Publisher: Elsevier Science
Year: 1984
Tongue: English
Weight: 865 KB
Volume: 11
Category: Article
ISSN: 0377-0427
DOI: 10.1016/0377-0427(84)90023-2

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A minimal algorithm for the multiple-cho

A minimal algorithm for the multiple-choice knapsack problem

✍ David Pisinger 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1017 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 fast algorithm for the linear multiple

A fast algorithm for the linear multiple-choice knapsack problem

✍ Krzysztof Dudziński; Stanisław Walukiewicz 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 256 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

Calculating the upper bound of the Multi

Calculating the upper bound of the Multiple-Choice Knapsack Problem

✍ Yuji Nakagawa; Masachika Kitao; Mitsuhiro Tsuji; Yoshinobu Teraoka 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

## Abstract An upper bound or a lower bound of the Multiple‐Choice Knapsack Problem can be calculated by solving LP relaxation. In 1979, Sinha and Zoltners proposed a branch‐and‐bound algorithm for solving the Multiple‐Choice Knapsack Problem, and provided a method to obtain the strict upper bound.