{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:35:31Z","timestamp":1774370131723,"version":"3.50.1"},"reference-count":15,"publisher":"Pleiades Publishing Ltd","issue":"3","license":[{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2017,3,1]],"date-time":"2017-03-01T00:00:00Z","timestamp":1488326400000},"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":[[2017,3]]},"DOI":"10.1134\/s0005117917030043","type":"journal-article","created":{"date-parts":[[2017,3,10]],"date-time":"2017-03-10T00:43:04Z","timestamp":1489106584000},"page":"425-434","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Genetic local search and hardness of approximation for the server load balancing problem"],"prefix":"10.1134","volume":"78","author":[{"given":"Yu. A.","family":"Kochetov","sequence":"first","affiliation":[]},{"given":"A. A.","family":"Panin","sequence":"additional","affiliation":[]},{"given":"A. V.","family":"Plyasunov","sequence":"additional","affiliation":[]}],"member":"137","published-online":{"date-parts":[[2017,3,11]]},"reference":[{"issue":"4","key":"591_CR1","first-page":"71","volume":"11","author":"Yu.A. Kochetov","year":"2013","unstructured":"Kochetov, Yu.A. and Kochetova, N.A., Server Load Balancing Problem, Vestn. Novosib. Gos. Univ., Ser. Inform. Tekhnol., 2013, vol. 11, no. 4, pp. 71\u201376.","journal-title":"Vestn. Novosib. Gos. Univ., Ser. Inform. Tekhnol"},{"issue":"6","key":"591_CR2","first-page":"21","volume":"21","author":"I.A. Davydov","year":"2014","unstructured":"Davydov, I.A., Kononova, P.A., and Kochetov, Yu.A., Local Search with Exponential Neighborhood for the Server Load Balancing Problem, Diskret. Anal. Issled. Oper., 2014, vol. 21, no. 6, pp. 21\u201334.","journal-title":"Diskret. Anal. Issled. Oper."},{"key":"591_CR3","first-page":"453","volume-title":"Supplement. Proc. 9th Int. Conf. Discret. Optim. Oper. Res. Sci. School (DOOR 2016)","author":"Yu. Kochetov","year":"2016","unstructured":"Kochetov, Yu., Panin, A., and Plyasunov, A., Genetic Local Search for the Servers Load Balancing Problem, Supplement. Proc. 9th Int. Conf. Discret. Optim. Oper. Res. Sci. School (DOOR 2016), 2016, pp. 453\u2013463."},{"key":"591_CR4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-58412-1","volume-title":"Complexity and Approximation: Combinatorial Optimization Problems and Their Aproximability Properties","author":"G. Ausiello","year":"1999","unstructured":"Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., and Protasi, M., Complexity and Approximation: Combinatorial Optimization Problems and Their Aproximability Properties, Berlin: Springer-Verlag, 1999."},{"key":"591_CR5","doi-asserted-by":"publisher","first-page":"272","DOI":"10.1016\/j.tcs.2005.03.007","volume":"339","author":"C. Bazgan","year":"2005","unstructured":"Bazgan, C., Escoffer, B., and Paschos, V.Th., Completeness in Standard and Differential Approximation Classes: Poly-(D)APX-and (D)PTAS-completeness, Theor. Comput. Sci., 2005, vol. 339, pp. 272\u2013292.","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"591_CR6","doi-asserted-by":"publisher","first-page":"1759","DOI":"10.1137\/S0097539796304220","volume":"28","author":"P. Crescenzi","year":"1999","unstructured":"Crescenzi, P., Kann, V., Silvestri, R., and Trevisan, L., Structure in Approximation Classes, SIAM J. Comput., 1999, vol. 28, no. 5, pp. 1759\u20131782.","journal-title":"SIAM J. Comput."},{"key":"591_CR7","first-page":"330","volume":"880","author":"P. Crescenzi","year":"1994","unstructured":"Crescenzi, P. and Trevisan, L., On Approximation Scheme Preserving Reducibility and Its Application, Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 880, 1994, Berlin: Springer-Verlag, pp. 330\u2013341.","journal-title":"Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science"},{"key":"591_CR8","volume-title":"Computers and Intractability: A Guide to the Theory of NPCompleteness","author":"M.R. Garey","year":"1982","unstructured":"Garey, M.R. and Johnson, D.S., Computers and Intractability: A Guide to the Theory of NPCompleteness, San Francisco: Freeman, 1979. Translation under the title Vychislitel\u2019nye mashiny i trudnoreshaemye zadachi, Moscow: Mir, 1982."},{"key":"591_CR9","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1016\/j.tcs.2006.05.023","volume":"359","author":"B. Escoffier","year":"2006","unstructured":"Escoffier, B. and Paschos, V.Th., Completeness in Approximation Classes beyond APX, Theor. Comput. Sci., 2006, vol. 359, pp. 369\u2013377.","journal-title":"Theor. Comput. Sci."},{"key":"591_CR10","doi-asserted-by":"publisher","DOI":"10.1002\/9780470496916","volume-title":"Metaheuristics: From Design to Implementation","author":"E.-G. Talbi","year":"2009","unstructured":"Talbi, E-G., Metaheuristics: From Design to Implementation, Berlin: Wiley, 2009."},{"issue":"1","key":"591_CR11","first-page":"3","volume":"14","author":"E.V. Alekseeva","year":"2007","unstructured":"Alekseeva, E.V. and Kochetov, Yu.A., Genetic Local Search for the p-Median Problem with Client Preferences, Diskret. Anal. Issled. Oper., Ser. 2, 2007, vol. 14, no. 1, pp. 3\u201331.","journal-title":"Diskret. Anal. Issled. Oper., Ser. 2"},{"issue":"1","key":"591_CR12","first-page":"164","volume":"52","author":"Yu.A. Kochetov","year":"2012","unstructured":"Kochetov, Yu.A. and Plyasunov, A.V., Genetic Local Search for the Graph Partitioning Problem into Shares of Bounded Cardinality, Zh. Vychisl. Mat. Mat. Fiz., 2012, vol. 52, no. 1, pp. 164\u2013176.","journal-title":"Zh. Vychisl. Mat. Mat. Fiz."},{"issue":"2","key":"591_CR13","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/A:1016560109076","volume":"1","author":"A. Dolgui","year":"2002","unstructured":"Dolgui, A., Eremeev, A., Kolokolov, A., and Sigaev, V., A Genetic Algorithm for the Allocation of Buffer Storage Capacities in a Production Line with Unreliable Machines, J. Math. Modell. Alg., 2002, vol. 1, no. 2, pp. 89\u2013104.","journal-title":"J. Math. Modell. Alg."},{"issue":"4","key":"591_CR14","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1134\/S0005117914040110","volume":"75","author":"A.A. Panin","year":"2014","unstructured":"Panin, A.A., Pashchenko, M.G., and Plyasunov, A.V., Bilevel Competitive Facility Location and Pricing Problems, Autom. Remote Control, 2014, vol. 75, no. 4, pp. 715\u2013727.","journal-title":"Autom. Remote Control"},{"issue":"3","key":"591_CR15","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1134\/S1990478915030102","volume":"9","author":"Yu. Kochetov","year":"2015","unstructured":"Kochetov, Yu., Panin, A., and Plyasunov, A., Comparison of Metaheuristics for the Bilevel Facility Location and Mill Pricing Problem, J. App. Ind. Math., 2015, vol. 9, no. 3, pp. 392\u2013401.","journal-title":"J. App. Ind. Math."}],"container-title":["Automation and Remote Control"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117917030043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1134\/S0005117917030043","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1134\/S0005117917030043.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,15]],"date-time":"2026-03-15T22:25:22Z","timestamp":1773613522000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1134\/S0005117917030043"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["591"],"URL":"https:\/\/doi.org\/10.1134\/s0005117917030043","relation":{},"ISSN":["0005-1179","1608-3032"],"issn-type":[{"value":"0005-1179","type":"print"},{"value":"1608-3032","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3]]},"assertion":[{"value":"22 May 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2017","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}