Heuristic for the 0-1 Min-Knapsack Problem.
János CsirikJ. B. G. FrenkMartine LabbéShuzhong ZhangPublished in: Acta Cybern. (1991)
Keyphrases
- knapsack problem
- exact algorithms
- optimal solution
- heuristic solution
- multidimensional knapsack problem
- randomly generated test instances
- greedy heuristic
- dynamic programming
- linear programming relaxation
- combinatorial optimization problems
- np hard
- optimization problems
- test problems
- greedy algorithm
- greedy algorithms
- bicriteria
- maximum profit
- production planning
- implicit enumeration
- lower bound
- cutting plane
- continuous relaxation
- lp relaxation
- np hard problems
- upper bound
- simulated annealing
- heuristic methods
- vehicle routing problem
- solution quality
- branch and bound
- genetic algorithm