𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The knapsack problem with generalized upper bounds

✍ Scribed by Salah E. Elmaghraby

Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
929 KB
Volume
38
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.

Solving the generalized knapsack problem
Solving the generalized knapsack problem with variable coefficients
✍ Kaj Holmberg; Kurt JΓΆrnsten πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 1012 KB

In this article we present methods based on Lagrangian duality and decomposition techniques for the generalized knapsack problem with variable coefficients. The Lagrangian dual is solved with subgradient optimization or interval bisection. We also describe a heuristic that yields primal feasible sol