A well-solvable special case of the bounded knapsack problem (Q2275577)
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 5937203
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A well-solvable special case of the bounded knapsack problem |
scientific article; zbMATH DE number 5937203 |
Statements
A well-solvable special case of the bounded knapsack problem (English)
0 references
9 August 2011
0 references
combinatorial optimization
0 references
computational complexity
0 references
polynomial time algorithm
0 references
cross ratio ordered
0 references
0 references
0.93213296
0 references
0 references
0.9023702
0 references
0.90198326
0 references
0.89981663
0 references
0.89981663
0 references
0 references
0.8943728
0 references
0.8926545
0 references
