𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The knapsack problem with disjoint multiple-choice constraints

✍ Scribed by Vijay Aggarwal; Narsingh Deo; Dilip Sarkar

Publisher
John Wiley and Sons
Year
1992
Tongue
English
Weight
750 KB
Volume
39
Category
Article
ISSN
0894-069X

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.