A scaleable projection-based branch-and-cut algorithm for the p-center problem.
Elisabeth GaarMarkus SinnlPublished in: CoRR (2021)
Keyphrases
- times faster
- objective function
- computationally efficient
- optimization algorithm
- computational complexity
- high accuracy
- cost function
- detection algorithm
- search space
- k means
- experimental evaluation
- dynamic programming
- genetic algorithm
- convergence rate
- theoretical analysis
- significant improvement
- preprocessing
- optimal solution
- similarity measure
- learning algorithm
- np hard
- computational cost
- least squares
- worst case
- expectation maximization
- image sequences
- experimental study
- tree structure
- neural network
- recognition algorithm
- estimation algorithm