1. Alekseeva, E., Kochetova, N., Kochetov, Y., Plyasunov, A., 2009. 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.
2. Heuristic and exact methods for the discrete (r∣p)-centroid problem;Alekseeva;Evolutionary Computation in Combinatorial Optimization,2010
3. Benati, S., Laporte, G., de Montréal. Centre de recherche sur les transports, U., 1994. Tabu Search Algorithms for the (r∣Xp)-Medianoid and (r∣p)-Centroid Problems. Université de Montréal, Centre de recherche sur les transports.
4. Relaxation of the condorcet and simpson conditions in voting location;Campos Rodriguez;European Journal of Operational Research,2003
5. Multiple voting location problems;Campos Rodrı´guez;European Journal of Operational Research,2008