Lifting for the integer knapsack cover polyhedron.
Wei-Kun ChenLiang ChenYu-Hong DaiPublished in: J. Glob. Optim. (2023)
Keyphrases
- extreme points
- knapsack problem
- optimal solution
- dynamic programming
- facet defining
- wavelet transform
- feasible solution
- upper bound
- convex hull
- euclidean space
- image processing
- information systems
- packing problem
- multiple choice
- linear program
- data sets
- computational complexity
- decision variables
- lifting scheme
- genetic algorithm
- strictly convex
- machine learning