Sequence Independent, Simultaneous and Multidimensional Lifting of Generalized Flow Covers for the Semi-Continuous Knapsack Problem with Generalized Upper Bounds Constraints.
Alejandro Angulo CardenasDaniel EspinozaRodrigo PalmaPublished in: IPCO (2014)
Keyphrases
- knapsack problem
- upper bound
- lower bound
- combinatorial optimization problems
- constraint satisfaction
- optimal solution
- wavelet transform
- optimization problems
- branch and bound
- dynamic programming
- lower and upper bounds
- linear constraints
- decision variables
- linear programming relaxation
- greedy heuristic
- heuristic solution
- multidimensional knapsack problem