{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:16:22Z","timestamp":1773656182763,"version":"3.50.1"},"reference-count":18,"publisher":"Pleiades Publishing Ltd","issue":"7","license":[{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T00:00:00Z","timestamp":1404172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Remote Control"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1134\/s0005117914070042","type":"journal-article","created":{"date-parts":[[2014,7,14]],"date-time":"2014-07-14T08:47:36Z","timestamp":1405327656000},"page":"1221-1230","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Solving a maximin location problem on the plane with given accuracy"],"prefix":"10.1134","volume":"75","author":[{"given":"G. G.","family":"Zabudskii","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. A.","family":"Koval\u2019","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"137","published-online":{"date-parts":[[2014,7,15]]},"reference":[{"key":"101_CR1","volume-title":"Diskretnye zadachi razmeshcheniya i polinomy ot bulevykh peremennykh","author":"VL Beresnev","year":"2005","unstructured":"Beresnev, V.L., Diskretnye zadachi razmeshcheniya i polinomy ot bulevykh peremennykh (Discrete Location Problems and Polynomials of Boolean Variables), Novosibirsk: Inst. Mat. Sib. Otd. Ross. Akad. Nauk, 2005."},{"key":"101_CR2","first-page":"618","volume":"28","author":"AV Panyukov","year":"1988","unstructured":"Panyukov, A.V. and Pelzwerger, B.V., Optimal Location of a Tree in a Finite Set, Zh. Vychisl. Mat. Mat. Fiz., 1988, vol. 28, pp. 618\u2013620.","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"key":"101_CR3","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0377-0427(91)90215-6","volume":"35","author":"AV Panyukov","year":"1991","unstructured":"Panyukov, A.V. and Pelzwerger, B.V., Polynomial Algorithms to Finite Veber Problem for a Tree Network, J. Comput. Appl. Math., 1991, vol. 35, pp. 291\u2013296.","journal-title":"J. Comput. Appl. Math."},{"issue":"5","key":"101_CR4","first-page":"3","volume":"16","author":"AA Ageev","year":"2009","unstructured":"Ageev, A.A., Gimadi, E.Kh., and Kurochkin, A.A., A Polynomial Algorithm for the Location Problem on a Chain with Identical Industrial Capacities of Plants, Diskret. Anal. Issled. Oper., 2009, vol. 16, no. 5, pp. 3\u201318.","journal-title":"Diskret. Anal. Issled. Oper."},{"issue":"12","key":"101_CR5","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1134\/S0005117906120101","volume":"67","author":"GG Zabudskii","year":"2006","unstructured":"Zabudskii, G.G., Model Building and Location Problem Solving in a Plane with Forbidden Gaps, Autom. Remote Control, 2006, vol. 67, no. 12, pp. 1986\u20131990.","journal-title":"Autom. Remote Control"},{"issue":"5","key":"101_CR6","doi-asserted-by":"publisher","first-page":"821","DOI":"10.1134\/S0005117912050062","volume":"73","author":"GG Zabudskii","year":"2012","unstructured":"Zabudskii, G.G. and Amzin, I.V., Search Region Contraction of the Weber Problem Solution on the Plane with Rectangular Forbidden Zones, Autom. Remote Control, 2012, vol. 73, no. 5, pp. 821\u2013830.","journal-title":"Autom. Remote Control"},{"issue":"2","key":"101_CR7","first-page":"44","volume":"12","author":"YuA Kochetov","year":"2005","unstructured":"Kochetov, Yu.A., Pashchenko, M.G., and Plyasunov, A.V., On the Complexity of Local Search for the p-Median Problem, Diskret. Anal. Issled. Oper., Ser. 2, 2005, vol. 12, no. 2, pp. 44\u201371.","journal-title":"Diskret. Anal. Issled. Oper., Ser. 2"},{"key":"101_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-2151-2","volume-title":"Facility Location: Concepts, Models, Algorithms and Case Studies","author":"RZ Farahani","year":"2009","unstructured":"Farahani, R.Z. and Hekmatfar, M., Facility Location: Concepts, Models, Algorithms and Case Studies, Heidelberg: Physica-Verlag Heidelberg, 2009."},{"key":"101_CR9","volume-title":"Location Theory","author":"S Nickel","year":"2005","unstructured":"Nickel, S. and Puerto, J., Location Theory, Heidelberg: Springer-Verlag, 2005."},{"key":"101_CR10","first-page":"88","volume-title":"Proc. XIV All-Russian Conf. \u201cMathematical Programming and Applications,\u201d","author":"GG Zabudskii","year":"2011","unstructured":"Zabudskii, G.G. and Koval\u2019, A.A., Object Location on a Plane with Maximin Criterion and Minimal Admissible Distances, Proc. XIV All-Russian Conf. \u201cMathematical Programming and Applications,\u201d Yekaterinburg: Inst. Mat. Mekh. Ural. Otd. Ross. Akad. Nauk, 2011, p. 88."},{"key":"101_CR11","first-page":"380","volume":"1","author":"GG Zabudskii","year":"2008","unstructured":"Zabudskii, G.G. and Markhotskaya, N.V., Solving the Maximin Location Problem on a Plane with Minimal Admissible Distances, Proc. XIV Baikal Int. School-Seminar \u201cOptimization Methods and Their Applications,\u201d Irkutsk: Inst. Sist. Energ. Sib. Otd. Ross. Akad. Nauk, 2008, vol. 1, pp. 380\u2013387.","journal-title":"Proc. XIV Baikal Int. School-Seminar \u201cOptimization Methods and Their Applications,\u201d"},{"issue":"1","key":"101_CR12","first-page":"11","volume":"2","author":"J Brimberg","year":"1994","unstructured":"Brimberg, J. and Mehrez, A., Multi-Facility Location Using a Maximin Criterion and Rectangular Distances, Location Sci., 1994, vol. 2, no. 1, pp. 11\u201319.","journal-title":"Location Sci."},{"key":"101_CR13","first-page":"1859","volume-title":"Comput. Oper. Res.","author":"MJ Katz","year":"2002","unstructured":"Katz, M.J., Kedem, K., and Segal, M., Improved Algorithms for Placing Undesirable Facilities, Comput. Oper. Res., 2002, no. 29, pp. 1859\u20131872."},{"key":"101_CR14","first-page":"97","volume-title":"Oper. Res. Lett.","author":"A Tamir","year":"2006","unstructured":"Tamir, A., Locating Two Obnoxious Facilities Using the Weighted Maximin Criterion, Oper. Res. Lett., 2006, no. 34, pp. 97\u2013105."},{"key":"101_CR15","volume-title":"Dekompozitsionnye metody optimizatsii proektnykh reshenii","author":"GM Levin","year":"1978","unstructured":"Levin, G.M. and Tanaev, V.S., Dekompozitsionnye metody optimizatsii proektnykh reshenii (Decomposition Optimization Methods for Design Solutions), Minsk: Nauka i Tekhnika, 1978."},{"key":"101_CR16","volume-title":"Dekompozitsiya i agregirovanie v zadachakh matematicheskogo programmirovaniya","author":"VS Tanaev","year":"1987","unstructured":"Tanaev, V.S., Dekompozitsiya i agregirovanie v zadachakh matematicheskogo programmirovaniya (Decomposition and Aggregation in Mathematical Programming Problems), Minsk: Nauka i Tekhnika, 1987."},{"key":"101_CR17","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry. An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P. and Shamos, M.G., Computational Geometry. An Introduction, New York: Springer, 1985. Translated under the title Vychislitel\u2019naya geometriya. Vvedenie, Moscow: Mir, 1988."},{"key":"101_CR18","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1287\/trsc.8.2.126","volume":"8","author":"PM Dearing","year":"1974","unstructured":"Dearing, P.M. and Francis, R.L., A Network Flow Solution to a Multifacility Minimax Location Problem Involving Rectilinear Distances, Transportat. Sci., 1974, vol. 8, pp. 126\u2013141.","journal-title":"Transportat. Sci."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117914070042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117914070042","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117914070042","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117914070042.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:24:56Z","timestamp":1773613496000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117914070042"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,7]]},"references-count":18,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["101"],"URL":"https:\/\/doi.org\/10.1134\/s0005117914070042","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,7]]},"assertion":[{"value":"16 November 2013","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 July 2014","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}