๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

The Knapsack Sharing Problem: An Exact Algorithm

โœ Scribed by Mhand Hifi; Slim Sadfi

Book ID
110321534
Publisher
Springer US
Year
2002
Tongue
English
Weight
187 KB
Volume
6
Category
Article
ISSN
1382-6905

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Some exact algorithms for the knapsack s
Some exact algorithms for the knapsack sharing problem
โœ Takeo Yamada; Mayumi Futakawa; Seiji Kataoka ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 446 KB

The knapsack sharing problem (KSP) is formulated as an extension to the ordinary knapsack problem. The KSP is .AlP-hard. We present a branch-and-bound algorithm and a binary search algorithm to solve this problem to optimality. These algorithms are implemented and computational experiments are carde

An exact algorithm for large multiple kn
An exact algorithm for large multiple knapsack problems
โœ David Pisinger ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 137 KB

The Multiple Knapsack Problem (MKP) is the problem of assigning a subset of n items to m distinct knapsacks, such that the total proยฎt sum of the selected items is maximized, without exceeding the capacity of each of the knapsacks. The problem has several applications in naval as well as ยฎnancial ma