A dual simplex-type algorithm for the smallest enclosing ball of balls.
Marta CavaleiroFarid AlizadehPublished in: Comput. Optim. Appl. (2021)
Keyphrases
- significant improvement
- learning algorithm
- dynamic programming
- experimental evaluation
- times faster
- preprocessing
- theoretical analysis
- cost function
- convex hull
- path planning
- randomly generated
- worst case
- computational cost
- k means
- search space
- primal dual
- selection algorithm
- recognition algorithm
- memory requirements
- genetic algorithm
- single pass
- clustering method
- optimization algorithm
- computationally efficient
- expectation maximization
- input data
- objective function