Shape annealing solution to the constrained geometric knapsack problem.
Jonathan CaganPublished in: Comput. Aided Des. (1994)
Keyphrases
- knapsack problem
- optimal solution
- greedy heuristic
- heuristic solution
- decision variables
- combinatorial optimization problems
- linear programming relaxation
- implicit enumeration
- dynamic programming
- optimization problems
- cutting plane
- np hard
- exact algorithms
- continuous relaxation
- multidimensional knapsack problem
- greedy algorithm
- geometric information
- bicriteria
- solution quality
- geometric shapes
- simulated annealing
- shape matching
- approximation algorithms
- shape descriptors
- lp relaxation
- branch and bound algorithm
- integer variables
- computational complexity
- search algorithm