An improved balanced algorithm for the subset-sum problem.
Vitor Venceslau CurtisCarlos Alberto Alonso SanchesPublished in: Eur. J. Oper. Res. (2019)
Keyphrases
- computational cost
- dynamic programming
- theoretical analysis
- worst case
- k means
- learning algorithm
- experimental study
- detection algorithm
- significant improvement
- improved algorithm
- recognition algorithm
- computationally efficient
- preprocessing
- single pass
- machine learning
- optimal solution
- simulated annealing
- knn
- computational complexity
- np hard
- least squares
- data structure
- particle swarm optimization
- search algorithm
- experimental evaluation
- objective function
- path planning
- memory requirements
- cost function
- search space
- greedy algorithms