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

Knapsack cost sharing

โœ Scribed by Darmann, Andreas; Klamler, Christian


Book ID
125351480
Publisher
Elsevier Science
Year
2014
Tongue
English
Weight
298 KB
Volume
18
Category
Article
ISSN
1434-4750

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Cost sharing and catch sharing
โœ Thorolfur Matthiasson ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 120 KB
Some exact algorithms for the knapsack s
โœ 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