Author:
Alekseeva Ekaterina,Kochetova Nina,Kochetov Yury,Plyasunov Alexandr
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Alekseeva, E., Kochetova, N.: Upper and lower bounds for the competitive p-median problem. In: Proceedings of XIV Baikal International School–Seminar Optimization Methods and Their Applications, Irkutsk, vol. 1, pp. 563–569 (2008) (in Russian)
2. Alekseeva, E., Kochetova, N., Kochetov, Y., Plyasunov, A.: A hybrid memetic algorithm for the competitive p-median problem. In: Preprints of the 13th IFAC Symposium on Information Control Problems in Manufacturing, Moscow, pp. 1516–1520 (2009)
3. Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed–integer problems. Discrete Optimization 4(1), 63–76 (2007)
4. Benati, S., Laporte, G.: Tabu search algorithms for the (r|X
p
)–medianoid and (r|p)–centroid problems. Location Science 2(4), 193–204 (1994)
5. Bhadury, J., Eiselt, H., Jaramillo, J.: An alternating heuristic for medianoid and centroid problems in the plane. Computers and Operations Research 30, 553–565 (2003)
Cited by
40 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献