A branch-and-cut algorithm for the discrete (r∣p)-centroid problem.
Marcos Costa RoboredoArtur Alves PessoaPublished in: Eur. J. Oper. Res. (2013)
Keyphrases
- k means
- experimental evaluation
- detection algorithm
- probabilistic model
- improved algorithm
- objective function
- times faster
- optimization algorithm
- search space
- significant improvement
- cost function
- computationally efficient
- learning algorithm
- segmentation algorithm
- high accuracy
- dynamic programming
- preprocessing
- computational complexity
- optimal solution
- neural network
- computational cost
- linear programming
- expectation maximization
- np hard
- theoretical analysis
- worst case
- search algorithm
- classification algorithm
- path planning
- selection algorithm
- estimation algorithm