A K-means Grasshopper Algorithm Applied to the Knapsack Problem.
Hernan PintoAlvaro PeñaLeonardo CausaMatías ValenzuelaGabriel VillavicencioPublished in: CSOC (2) (2020)
Keyphrases
- knapsack problem
- k means
- optimal solution
- dynamic programming
- np hard
- clustering method
- computational complexity
- objective function
- learning algorithm
- np hard problems
- optimization problems
- linear programming
- multidimensional knapsack problem
- greedy heuristic
- test problems
- hierarchical clustering
- implicit enumeration
- data clustering
- optimization algorithm
- expectation maximization
- simulated annealing
- combinatorial optimization problems
- worst case
- bicriteria
- search space
- reinforcement learning
- clustering algorithm