This is a preview of subscription content, log in via an institution to check access.
Literature Cited
Sh. K. Gimatudinov (ed.), A Handbook for Planning the Development of Oil Deposits [in Russian], Nedra, Moscow (1983).
M. V. Meerov (ed.), Managing the Development of Oil Deposits [in Russian], Nedra, Moscow (1983).
V. R. Khachaturov and S. U. Kaldybaev, “Solution of one integer location problem by an approximate combinatorial method,” in: Software Systems for the Solution of Optimal Planning Problems, 4th All-Union Symposium, Abstracts of papers (Narva-Iyésuu, 5–14 June 1976) [in Russian], TsEMI AN SSSR, Moscow (1976), pp. 115–118.
O. Yu. Pershin, “One class of problems of optimal network design,” Kibernetika, No. 5, 76–80 (1985).
O. Yu. Pershin, “Design of optimal radial networks,”Izv. AN SSSR, Tekh. Kibern., No. 2, 107–112 (1985).
A. M. Geoffrion and R. E. Marsten, “Integer programming algorithms: a framework and state-of-the-art survey,” Manag. Sci.,18, No. 9, 465–491 (1972).
I. V. Sergienko and M. Ya. Kaspshitskaya, Models and Methods of Solution of Combinatorial Optimization Problems by Computer [in Russian], Naukova Dumka, Kiev (1981).
M. R. Garey and D. S. Johnson, Computers and Intractability, W. H. Freeman (1979).
A. B. Boronin and O. Yu. Pershin, “Partitioning a network into minimally connected parts,” Avtomat. Telemekh., No. 4, 128–138 (1984).
R. K. Prim, “Shortest connecting networks and some generalizations,” Kibernet. Sb., No. 2, 95–107 (1961).
L. Cooper, “Location-allocation problems,” Oper. Res.11, No. 3, 331–343 (1963).
Additional information
Translated from Kibernetika, No. 2, pp. 46–51, March–April, 1988.
Rights and permissions
About this article
Cite this article
Boronin, A.B., Pershin, O.Y. Dynamic location problems with radial structure of the components of the connecting graph. Cybern Syst Anal 24, 195–203 (1988). https://doi.org/10.1007/BF01082609
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01082609