On Guillotine Separable Packings for the Two-dimensional Geometric Knapsack Problem.
Arindam KhanArnab MaitiAmatya SharmaAndreas WiesePublished in: CoRR (2021)
Keyphrases
- knapsack problem
- dynamic programming
- packing problem
- combinatorial optimization problems
- optimization problems
- np hard
- test problems
- greedy algorithm
- three dimensional
- linear programming relaxation
- exact algorithms
- optimal solution
- greedy heuristic
- heuristic solution
- multidimensional knapsack problem
- continuous relaxation
- np hard problems
- evolutionary algorithm
- decision variables
- vehicle routing problem
- implicit enumeration
- search algorithm
- randomly generated test instances