A hybrid heuristic for the 0-1 knapsack problem with items of irregular shape.
Leandro Resende MundimThiago Alves de QueirozPublished in: CLEI (2012)
Keyphrases
- knapsack problem
- combinatorial optimization problems
- arbitrarily shaped
- exact algorithms
- optimal solution
- optimization problems
- test problems
- dynamic programming
- multidimensional knapsack problem
- greedy algorithm
- shape model
- bicriteria
- np hard
- shape descriptors
- linear programming relaxation
- continuous relaxation
- shape matching
- np hard problems
- heuristic solution
- greedy heuristic
- search algorithm
- multiple objectives
- evolutionary algorithm
- shape analysis
- maximum profit
- decision variables
- medial axis
- metaheuristic
- graph cuts
- particle swarm optimization
- multi objective
- implicit enumeration