No label defined (Q3751378)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3989108
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 3989108 |
Statements
1987
0 references
extensive survey
0 references
knapsack problems
0 references
subset-sum
0 references
multiple knapsack
0 references
relaxations
0 references
upper bounds
0 references
reduction procedures
0 references
exact and approximate algorithms
0 references
computational experiments
0 references
0.96246517
0 references
0.9219654
0 references
0 references
0.91880816
0 references
0.91662097
0 references
0 references
[For the entire collection see Zbl 0599.00013.] The paper presents an extensive survey on knapsack problems. The 0-1 single knapsack problem, the subset-sum problem and the 0-1 multiple knapsack problem are studied with great detail, by analyzing and comparing relaxations, upper bounds, reduction procedures, exact and approximate algorithms, computational experiments. The unbounded knapsack problem, the bounded knapsack problem and the change-making problem are also considered. The references section contains 81 titles.
0 references