A robust and efficient algorithm for planar competitive location problems.
Juana López RedondoJosé-Jesús FernándezInmaculada GarcíaPilar Martínez OrtigosaPublished in: Ann. Oper. Res. (2009)
Keyphrases
- computationally efficient
- location problems
- single pass
- highly efficient
- detection algorithm
- np hard
- learning algorithm
- segmentation algorithm
- simulated annealing
- k means
- cost function
- dynamic programming
- space complexity
- preprocessing
- matching algorithm
- bicriteria
- optimal solution
- expectation maximization
- probabilistic model
- computational complexity
- random walk
- worst case
- evolutionary algorithm
- lower bound
- search algorithm