A fast algorithm for the linear multiple-choice knapsack problem (Q800227)
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 3876924
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fast algorithm for the linear multiple-choice knapsack problem |
scientific article; zbMATH DE number 3876924 |
Statements
A fast algorithm for the linear multiple-choice knapsack problem (English)
0 references
1984
0 references
fast algorithm
0 references
median finding in ordered sets
0 references
linear multiple-choice knapsack problem
0 references
branch-and bound approach
0 references
0.9592994
0 references
0.9552167
0 references
0.93614626
0 references
0.9223261
0 references
0 references
0.9188123
0 references
0.9180552
0 references
