An efficient algorithm for the single facility location problem with polyhedral norms and disk-shaped demand regions.
André BergerAlexander GrigorievAndrej WinokurowPublished in: Comput. Optim. Appl. (2017)
Keyphrases
- dynamic programming
- np hard
- probabilistic model
- expectation maximization
- dominating set
- convex hull
- segmentation algorithm
- simulated annealing
- facility location problem
- computational complexity
- search algorithm
- graphical models
- linear programming
- markov random field
- worst case
- energy function
- special case
- evolutionary algorithm