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

A Polynomial-Time Algorithm for the Knapsack Problem with Two Variables

โœ Scribed by Hirschberg, D. S.; Wong, C. K.

Book ID
121864546
Publisher
Association for Computing Machinery
Year
1976
Tongue
English
Weight
458 KB
Volume
23
Category
Article
ISSN
0004-5411

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A parallel two-list algorithm for the kn
A parallel two-list algorithm for the knapsack problem
โœ Der-Chyuan Lou; Chin-Chen Chang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 695 KB

An n-element knapsack problem has 2" possible solutions to search over, so a task which can be accomplished in 2" trials if an exhaustive search is used. Due to the exponential time in solving the knapsack problem, the problem is considered to be very hard. In the past decade, much effort has been d