New relaxation-based algorithms for the optimal solution of the continuous and discrete p-center problems.
Doron ChenReuven ChenPublished in: Comput. Oper. Res. (2009)
Keyphrases
- optimal solution
- continuous domains
- approximate solutions
- optimization problems
- computational geometry
- discrete data
- benchmark problems
- test problems
- continuous state spaces
- computational efficiency
- learning algorithm
- continuous data
- significant improvement
- hybrid algorithm
- search methods
- iterative algorithms
- computationally efficient
- greedy heuristic
- computational complexity
- combinatorial optimization
- exact algorithms
- np hard
- computational cost
- np complete
- problems in computer vision
- branch and bound algorithm
- semidefinite
- lp relaxation
- heuristic methods
- objective function
- discrete variables