𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The 0–1 knapsack problem with multiple choice constraints

✍ Scribed by Robert M. Nauss

Publisher
Elsevier Science
Year
1978
Tongue
English
Weight
787 KB
Volume
2
Category
Article
ISSN
0377-2217

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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.