Subadditive lifting methods for partitioning and knapsack problems (Q3877407)
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 3681491
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Subadditive lifting methods for partitioning and knapsack problems |
scientific article; zbMATH DE number 3681491 |
Statements
Subadditive lifting methods for partitioning and knapsack problems (English)
0 references
1980
0 references
knapsack problem
0 references
subadditive function
0 references
duality
0 references
subadditive lifting methods
0 references
packing
0 references
covering
0 references
partitioning
0 references
knapsack-partitioning problem
0 references
single equality constraint
0 references
implementations
0 references
dual simplex algorithm
0 references
shortest path methods
0 references
dynamic programming
0 references
group approach
0 references
branch-and- bound
0 references
dual feasible subadditive lifting methods
0 references
