Strengthening a linear reformulation of the 0-1 cubic knapsack problem via variable reordering.
Richard J. ForresterLucas A. WaddellPublished in: J. Comb. Optim. (2022)
Keyphrases
- knapsack problem
- linear functions
- combinatorial optimization problems
- decision variables
- optimization problems
- np hard
- optimal solution
- dynamic programming
- linear programming relaxation
- test problems
- multidimensional knapsack problem
- greedy algorithm
- np hard problems
- bicriteria
- integer variables
- greedy heuristic
- exact algorithms
- maximum profit
- cutting plane
- multiple objectives
- heuristic solution
- objective function
- implicit enumeration
- cost function
- linear programming
- combinatorial problems
- scheduling problem
- b spline
- metaheuristic