Solving 0-1 knapsack problem by greedy degree and expectation efficiency.
Jianhui LvXingwei WangMin HuangHui ChengFuliang LiPublished in: Appl. Soft Comput. (2016)
Keyphrases
- knapsack problem
- greedy algorithm
- greedy heuristic
- dynamic programming
- implicit enumeration
- randomly generated test instances
- greedy algorithms
- optimal solution
- combinatorial optimization problems
- optimization problems
- linear relaxation
- test problems
- np hard
- lp relaxation
- linear programming relaxation
- multidimensional knapsack problem
- integer variables
- exact algorithms
- heuristic solution
- np hard problems
- bicriteria
- continuous relaxation
- multiple objectives
- combinatorial optimization
- neural network
- computational complexity
- search space
- decision variables
- cutting plane
- exact solution
- vehicle routing problem
- linear programming
- np complete