On Guillotine Separable Packings for the Two-Dimensional Geometric Knapsack Problem.
Arindam KhanArnab MaitiAmatya SharmaAndreas WiesePublished in: SoCG (2021)
Keyphrases
- knapsack problem
- packing problem
- combinatorial optimization problems
- optimal solution
- three dimensional
- exact algorithms
- dynamic programming
- np hard
- test problems
- bicriteria
- optimization problems
- greedy algorithm
- multidimensional knapsack problem
- np hard problems
- continuous relaxation
- linear programming relaxation
- greedy heuristic
- neural network
- bayesian networks
- cutting plane
- heuristic solution
- randomly generated test instances
- multiple objectives
- linear programming
- evolutionary algorithm