Subadditive lifting methods for partitioning and knapsack problems (Q3877407): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
links / mardi / name | links / mardi / name | ||
Revision as of 19:50, 5 February 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Subadditive lifting methods for partitioning and knapsack problems |
scientific article |
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