@article{IVM_2004_5_a3,
author = {G. G. Zabudskii and D. V. Filimonov},
title = {Solution of a discrete minimax location problem on networks},
journal = {Izvesti\^a vys\v{s}ih u\v{c}ebnyh zavedenij. Matematika},
pages = {33--36},
year = {2004},
number = {5},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/IVM_2004_5_a3/}
}
G. G. Zabudskii; D. V. Filimonov. Solution of a discrete minimax location problem on networks. Izvestiâ vysših učebnyh zavedenij. Matematika, no. 5 (2004), pp. 33-36. http://geodesic.mathdoc.fr/item/IVM_2004_5_a3/
[1] Zabudskii G. G., “Algoritm resheniya odnoi zadachi optimalnogo lineinogo uporyadocheniya”, Izv. vuzov. Matematika, 1997, no. 12, 73–78 | MR | Zbl
[2] Zabudskii G. G., Filimonov D. V., “O minimaksnoi i minisummnoi zadachakh razmescheniya na setyakh”, Tr. XII Baikalskoi mezhdunar. konf. “Metody optimizatsii i ikh prilozheniya”, Irkutsk, 2001, 150–155
[3] Panyukov A. V., Peltsverger B. V., “Optimalnoe razmeschenie dereva v konechnom mnozhestve”, Zhurn. vychisl. matem. i matem. fiz., 28 (1988), 618–620 | MR | Zbl
[4] Filimonov D. V., “Reshenie diskretnoi minimaksnoi zadachi razmescheniya na drevovidnoi seti”, Materialy ezhegodn. nauchn. semin. aspirantov i studentov-vypusknikov "Pod znakom $\Sigma$", Omsk, 2003, 58–61
[5] Erkut E., Francis R. L., Tamir A., “Distance-constrained multifacility minimax location problems on tree network”, Networks, 22 (1992), 37–54 | DOI | MR | Zbl
[6] Kolen A., Location problems on trees and in rectilinear plane, Stitchting Math. Centrum, Kruislaan 413, 1098 SJ Amsterdam, The Netherlands, 1982