A o(n logn) algorithm for LP knapsacks with GUB constraints (Q3854926)
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 3655670
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A o(n logn) algorithm for LP knapsacks with GUB constraints |
scientific article; zbMATH DE number 3655670 |
Statements
A o(n logn) algorithm for LP knapsacks with GUB constraints (English)
0 references
1979
0 references
integer programming
0 references
multiple choice
0 references
surrogate constraints
0 references
linear programming knapsack problem
0 references
generalized upper bound
0 references
dual simplex method
0 references
convex screening of variables
0 references
polynomial time algorithm
0 references
computational complexity
0 references
