{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T23:20:06Z","timestamp":1773616806044,"version":"3.50.1"},"reference-count":32,"publisher":"Pleiades Publishing Ltd","issue":"7","license":[{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,7,1]],"date-time":"2016-07-01T00:00:00Z","timestamp":1467331200000},"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":[[2016,7]]},"DOI":"10.1134\/s0005117916070079","type":"journal-article","created":{"date-parts":[[2016,7,12]],"date-time":"2016-07-12T04:43:56Z","timestamp":1468298636000},"page":"1208-1215","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Algorithm for the discrete Weber\u2019s problem with an accuracy estimate"],"prefix":"10.1134","volume":"77","author":[{"given":"A. V.","family":"Panyukov","sequence":"first","affiliation":[]},{"given":"R. E.","family":"Shangin","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2016,7,13]]},"reference":[{"issue":"2","key":"474_CR1","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1134\/S0005117912020117","volume":"73","author":"G.G. Zabudskii","year":"2012","unstructured":"Zabudskii, G.G. and Lagzdin, A.Yu., Dynamic Programming for the Quadratic Assignment Problem on Trees, Autom. Remote Control, 2012, vol. 73, no. 2, pp. 336\u2013348.","journal-title":"Autom. Remote Control"},{"issue":"8","key":"474_CR2","first-page":"1162","volume":"60","author":"S.I. Sergeev","year":"1999","unstructured":"Sergeev, S.I., The Quadratic Assignment Problem. I. New Lower Bounds in a Dual Assignment Scheme, Autom. Remote Control, 1999, vol. 60, no. 8, pp. 1162\u20131178.","journal-title":"Autom. Remote Control"},{"issue":"9","key":"474_CR3","first-page":"1326","volume":"60","author":"S.I. Sergeev","year":"1999","unstructured":"Sergeev, S.I., The Quadratic Assignment Problem. II. Refined Gilmore\u2013Lawler Algorithm, Autom. Remote Control, 1999, vol. 60, no. 9, pp. 1326\u20131331.","journal-title":"Autom. Remote Control"},{"key":"474_CR4","volume-title":"Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables","author":"F. Muldoon","year":"2012","unstructured":"Muldoon, F., Polyhedral Approximations of Quadratic Semi-Assignment Problems, Disjunctive Programs, and Base-2 Expansions of Integer Variables, Clemson: Clemson Univ., 2012."},{"key":"474_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/j.disopt.2008.08.003","volume":"6","author":"H. Saito","year":"2009","unstructured":"Saito, H. and Fujie, T., A Study of the Quadratic Semi-Assignment Polytope, Discret. Optim., 2009, vol. 6, pp. 37\u201350.","journal-title":"Discret. Optim."},{"key":"474_CR6","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-1-4757-3155-2_8","volume":"7","author":"S. Voss","year":"2000","unstructured":"Voss, S., Heuristics for Nonlinear Assignment Problems, Combinat. Optim., 2000, vol. 7, pp. 175\u2013215.","journal-title":"Combinat. Optim."},{"key":"474_CR7","volume-title":"Quadratic Assignment Problems: Solution Methods and Applications","author":"F. Malucelli","year":"1993","unstructured":"Malucelli, F., Quadratic Assignment Problems: Solution Methods and Applications, PhD Dissertation, University of Pisa, 1993."},{"key":"474_CR8","volume-title":"Models and Methods for Construction and Identification Problems of Geometric Assignment","author":"A.V. Panyukov","year":"1999","unstructured":"Panyukov, A.V., Models and Methods for Construction and Identification Problems of Geometric Assignment, Doctoral (Phys.\u2013Math.) Dissertation, Chelyabinsk, 1999."},{"key":"474_CR9","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1145\/321958.321975","volume":"23","author":"S. Sahni","year":"1976","unstructured":"Sahni, S. and Gonzalez, T., TP-complete Approximation Problems, ACM J., 1976, vol. 23, pp. 555\u2013565.","journal-title":"ACM J."},{"key":"474_CR10","first-page":"150","volume-title":"Proc. XII Baikal Int. Conf. \u201cOptimization Methods and Their Applications,\u201d","author":"G.G. Zabudskii","year":"2001","unstructured":"Zabudskii, G.G. and Filimonov, D.V., On Minimax and Minisum Assignment Problems on Networks, Proc. XII Baikal Int. Conf. \u201cOptimization Methods and Their Applications,\u201d Irkutsk: ISEM SORAN, 2001, pp. 150\u2013155."},{"key":"474_CR11","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0377-0427(91)90215-6","volume":"35","author":"A.V. 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."},{"key":"474_CR12","first-page":"743","volume":"6","author":"S.H. Bokhari","year":"1981","unstructured":"Bokhari, S.H., A Shortest Tree Algorithm for Optimal Assignments Across Space and Time in a Distributed Processor System, IEEE Trans. Software Eng., 1981, vol. SE-7(6), pp. 743\u2013752.","journal-title":"IEEE Trans. Software Eng."},{"issue":"3","key":"474_CR13","first-page":"64","volume":"21","author":"A.V. Panyukov","year":"2014","unstructured":"Panyukov, A.V. and Shangin, R.E., An Exact Algorithm for Solving the Discrete Weber Problem for a k-Tree, Diskret. Anal. Issled. Oper., 2014, vol. 21, no. 3, pp. 64\u201375.","journal-title":"Diskret. Anal. Issled. Oper."},{"issue":"5","key":"474_CR14","first-page":"84","volume":"20","author":"R.E. Shangin","year":"2013","unstructured":"Shangin, R.E., A Deterministic Algorithm for Solving the Weber Problem for an n-Sequentially Connected Chain, Diskret. Anal. Issled. Oper., 2013, vol. 20, no. 5, pp. 84\u201396.","journal-title":"Diskret. Anal. Issled. Oper."},{"key":"474_CR15","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TSE.1977.233840","volume":"1","author":"H.S. Stone","year":"1977","unstructured":"Stone, H.S., Multiprocessor Scheduling with the Aid of Network Flow Algorithms, IEEE Trans. Software Eng., 1977, vol. SE-3(1), pp. 85\u201393.","journal-title":"IEEE Trans. Software Eng."},{"key":"474_CR16","volume-title":"andbook of Combinatorial Optimization","author":"E. Burkard","year":"2000","unstructured":"Burkard, E. and Pardalos, P., The Quadratic Assignment Problem, in andbook of Combinatorial Optimization, New York: Kluwer, 2000."},{"key":"474_CR17","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1016\/0377-2217(95)00053-4","volume":"91","author":"F. Malucelli","year":"1996","unstructured":"Malucelli, F., A Polynomially Solvable Class of the Quadratic Semi-Assignment Problems, Eur. J. Oper. Res., 1996, vol. 91, pp. 619\u2013622.","journal-title":"Eur. J. Oper. Res."},{"key":"474_CR18","first-page":"57","volume":"69","author":"F. Malucelli","year":"1994","unstructured":"Malucelli, F. and Pretolani, D., Quadratic Semi-Assignment Problem on Structured Graphs, Ric. Oper., 1994, vol. 69, pp. 57\u201378.","journal-title":"Ric. Oper."},{"key":"474_CR19","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/0377-2217(95)00013-G","volume":"83","author":"F. Malucelli","year":"1995","unstructured":"Malucelli, F. and Pretolani, D., Lower Bounds for the Quadratic Semi-Assignment Problem, Eur. J. Oper. Res., 1995, vol. 83, pp. 365\u2013375.","journal-title":"Eur. J. Oper. Res."},{"key":"474_CR20","volume-title":"Lower Bounds for the Quadratic Semi-Assignment Problem","author":"G. Gallo","year":"1986","unstructured":"Gallo, G., Tomasin, E.M., and Sorato, A.M., Lower Bounds for the Quadratic Semi-Assignment Problem, New Brunswick: Rutgers Univ., 1986."},{"key":"474_CR21","first-page":"17","volume":"11","author":"W. Domschke","year":"1989","unstructured":"Domschke, W., Schedule Synchronization for Public Transit Networks, ORSpektrum, 1989, no. 11, pp. 17\u201324.","journal-title":"Schedule Synchronization for Public Transit"},{"key":"474_CR22","first-page":"389","volume-title":"New Directions for Operations Research in Manufacturing","author":"P. Forst","year":"1992","unstructured":"Domschke,W., Forst, P., and Voss, S., Tabu Search Techniques for the Quadratic Semi-Assignment Problem, in New Directions for Operations Research in Manufacturing, Berlin: Springer, 1992, pp. 389\u2013405."},{"key":"474_CR23","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/978-3-642-85968-7_10","volume-title":"Network Design Formulations in Schedule Synchronization, Computer-Aided Transit Scheduling","author":"S. Voss","year":"1992","unstructured":"Voss, S., Network Design Formulations in Schedule Synchronization, Computer-Aided Transit Scheduling, vol. 386 of Lecture Notes in Economics and Mathematical Systems, Berlin: Springer, 1992, pp. 137\u2013152."},{"key":"474_CR24","first-page":"333","volume-title":"Network Optimization Problems","author":"S. Voss","year":"1993","unstructured":"Voss, S., Tabu Search: Applications and Prospects, in Network Optimization Problems, Du, D.-Z. and Pardalos, P., Eds., Singapore: World Scientific, 1993, pp. 333\u2013353."},{"key":"474_CR25","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0020-0190(97)00008-2","volume":"61","author":"F. Roupin","year":"1997","unstructured":"Roupin, F., On Approximating the Memory-Constrained Module Allocation Problem, Inform. Proc. Lett., 1997, vol. 61, pp. 205\u2013208.","journal-title":"Inform. Proc. Lett."},{"key":"474_CR26","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C., Shortest Connection Networks and Some Generalizations, Bell Syst. Technic. J., 1957, vol. 36, pp. 1389\u20131401.","journal-title":"Bell Syst. Technic. J."},{"key":"474_CR27","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1090\/S0002-9939-1956-0078686-7","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B., On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem, Proc. Am. Math. Soc., 1956, vol. 7, pp. 48\u201350.","journal-title":"Proc. Am. Math. Soc."},{"key":"474_CR28","first-page":"35","volume":"31","author":"E.Kh. Gimadi","year":"1975","unstructured":"Gimadi, E.Kh., Glebov, N.I., and Perepelitsa, V.A., Algorithms with Bounds for Discrete Optimization Problems, in Problemy Kibernetiki (Cybernetics Problems), Moscow: Nauka, 1975, vol. 31, pp. 35\u201342.","journal-title":"Problemy Kibernetiki"},{"key":"474_CR29","first-page":"2338","volume-title":"Proc. XII Russ. Sem. Control Problems VSPU-2014","author":"A.V. Panyukov","year":"2014","unstructured":"Panyukov, A.V. and Shangin, R.E., Approximate Algorithms for Constructing a Minimal Spanning k- Tree, Proc. XII Russ. Sem. Control Problems VSPU-2014, Moscow, June 16\u201319, 2014, pp. 2338\u20132351, http:\/\/vspu2014ipuru\/proceedings\/vspu2014zip."},{"key":"474_CR30","unstructured":"Shangin, R.E., Pardalos, P.M., and Panyukov, A.V., Heuristic Algorithms for Constructing a Minimal Spanning k-Tree, Proc. XVI Baikal Int. School\u2013Seminar \u201cMethods of Optimization and Their Applications,\u201d Irkutsk: ISEM SORAN, p. 122."},{"key":"474_CR31","doi-asserted-by":"publisher","first-page":"1074","DOI":"10.1016\/j.procs.2014.05.362","volume":"31","author":"R. Shangin","year":"2014","unstructured":"Shangin, R. and Pardalos, P., Heuristics for Minimum Spanning k-tree Problem, Procedia Comput. Sci., 2014, vol. 31, pp. 1074\u20131083.","journal-title":"Procedia Comput. Sci."},{"key":"474_CR32","first-page":"96","volume":"4","author":"R.E. Shangin","year":"2013","unstructured":"Shangin, R.E., Exact Algorithm for Solving Discrete Weber Problem for a Cycle, Prikl. Diskret. Mat., 2013, no. 4, pp. 96\u2013102.","journal-title":"Prikl. Diskret. Mat."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916070079.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117916070079","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916070079","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117916070079.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:26:16Z","timestamp":1773613576000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117916070079"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7]]},"references-count":32,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2016,7]]}},"alternative-id":["474"],"URL":"https:\/\/doi.org\/10.1134\/s0005117916070079","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,7]]},"assertion":[{"value":"19 July 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2016","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}