A Binary Grasshopper Algorithm Applied to the Knapsack Problem.
Hernan PintoAlvaro PeñaMatías ValenzuelaAndrés FernándezPublished in: CSOS (2) (2018)
Keyphrases
- knapsack problem
- optimal solution
- dynamic programming
- np hard
- greedy heuristic
- test problems
- learning algorithm
- multidimensional knapsack problem
- search space
- simulated annealing
- optimization algorithm
- implicit enumeration
- combinatorial optimization problems
- combinatorial optimization
- linear programming
- cost function
- computational complexity
- convex hull
- greedy algorithm
- optimization problems
- worst case
- shortest path problem
- cutting plane
- np hard problems
- objective function