AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints (Q3312019)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints |
scientific article; zbMATH DE number 3841619
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints |
scientific article; zbMATH DE number 3841619 |
Statements
AnO (n)-algorithm for LP-knapsacks with a fixed number of GUB constraints (English)
0 references
1984
0 references
linear programming knapsack problem
0 references
generalized upper bounds
0 references
parametric programming
0 references
