Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. S. Ahn, C. Cooper, G. Cornuéjols and A. M. Frieze. Probabilistic analysis of a relaxation for the k-median problem. Mathematics of Operations Research, 13:1–31, 1988.
2. K. S. Al-Sultan and M. A. Al-Fawzan. A tabu search approach to the uncapacitated facility location problem. Annals of Operations Research, 86:91–103, 1999.
3. M. L. Alves and M. T. Almeida. Simulated annealing algorithm for simple plant location problems. Rev. Invest., 12, 1992.
4. V. Arya, N. Garg, R. Khandekar, A. Meyerson, K. Munagala and V. Pandit. Local search heuristics for k-median and facility location problems. ACM Symposium on Theory of Computing, pages 21–29, 2001.
5. F. Barahona. An implementation of the Volume algorithm. IBM COIN-OR website,
http://oss.software.ibm.com/developerworks/opensource/coin
, 2000.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献