𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The linking set problem: a polynomial special case of the multiple-choice knapsack problem

✍ Scribed by A. Agra; C. Requejo

Publisher
Springer US
Year
2009
Tongue
English
Weight
177 KB
Volume
161
Category
Article
ISSN
1573-8795

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.

Development of core to solve the multidi
Development of core to solve the multidimensional multiple-choice knapsack problem
✍ Taha Ghasemi; Mohammadreza Razzazi πŸ“‚ Article πŸ“… 2011 πŸ› Elsevier Science 🌐 English βš– 426 KB

The multidimensional multiple-choice knapsack problem (MMKP) is an extension of the 0-1 knapsack problem. The core concept has been used to design efficient algorithms for the knapsack problem but the core has not been developed for the MMKP so far. In this paper, we develop an approximate core for