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

An improved direct descent algorithm for binary knapsack problems

โœ Scribed by Richard A. Murphy

Book ID
107950826
Publisher
Elsevier Science
Year
1989
Tongue
English
Weight
717 KB
Volume
16
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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