New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094)
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 5634564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems |
scientific article; zbMATH DE number 5634564 |
Statements
New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (English)
0 references
17 November 2009
0 references
bounded knapsack problem
0 references
bounded multiple-choice knapsack problem
0 references
pseudopolynomial algorithms
0 references
multicover problem
0 references
0 references
0.8056504130363464
0 references
0.8006062507629395
0 references
0.7971622347831726
0 references
