Enhanced formulation for the Guillotine 2D Cutting Knapsack Problem.
Henrique BeckerOlinto C. B. de AraújoLuciana S. BuriolPublished in: Math. Program. Comput. (2022)
Keyphrases
- knapsack problem
- heuristic solution
- linear programming relaxation
- binary variables
- combinatorial optimization problems
- optimal solution
- dynamic programming
- lp relaxation
- optimization problems
- test problems
- np hard
- exact algorithms
- multidimensional knapsack problem
- bicriteria
- multiple objectives
- greedy heuristic
- greedy algorithm
- np hard problems
- decision variables
- lower bound
- learning algorithm
- implicit enumeration
- machine learning
- maximum profit
- quadratic programming
- vehicle routing problem