1. Beresnev, V.L., Diskretnye zadachi razmeshcheniya i polinomy ot hulevykh peremennykh (Discrete Location Problems and Polynomials of Boolean Variables), Novosibirsk: Inst. Mat., Sib. Otd. Ross. Akad. Nauk, 2005.
2. Nickel, S. and Puerto, J., Location Theory, Berlin: Springer-Verlag, 2005.
3. Panyukov, A.V. and Pelzwerger, B.V., Polynomial Algorithms to Finite Weber Problem for a Tree Network, J. Comput. Appl. Math., 1991, vol. 35, pp. 291–296.
https://doi.org/10.1016/0377-0427(91)90215-6
4. Panyukov, A.V., Lhe Relaxation Polyhedron of Weber Problem, in Non-smooth and Discontinuous Problems of Control and Optimization, Chelyabinsk: Chelyab. Gos. Univ., 1998, pp. 171–174.
5. Panyukov, A.V., Location of a Tree Network for a Finite Set, Abstracts of the Seventh Czech-Slovak International Symposium on Graph Theory, Combinatorics, Algorithms and Applications, Kosice, Slovakia, Safary University, 2013, pp. 64–65.