Avtomatika i Telemekhanika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors
Submit a manuscript

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Avtomat. i Telemekh.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Avtomatika i Telemekhanika, 2017, Issue 3, Pages 51–62 (Mi at14731)  
This article is cited in 4 scientific papers (total in 4 papers)

Stochastic Systems, Queuing Systems

Genetic local search and hardness of approximation for the server load balancing problem

Yu. A. Kochetovab, A. A. Paninab, A. V. Plyasunovab

a Novosibirsk State University, Novosibirsk, Russia
b Sobolev Institute of Mathematics, Siberian Branch, Russian Academy of Sciences, Novosibirsk, Russia
Full-text PDF (632 kB) Citations (4)
References:
PDF
HTML
Abstract: We consider a well-known NP-hard server load balancing problem. We study the computational complexity of finding approximate solutions with guaranteed accuracy estimate. We show that this problem is Log-APX-hard with respect to PTAS reductions. To solve the problem, we develop an approximate method based on the ideas of genetic local search. We show results of computational experiments.
Keywords: load balancing, local search, genetic algorithm, approximation.
Funding agency Grant number
Ministry of Education and Science of the Republic of Kazakhstan 0115PK00546
This work was supported by the Ministry of Science and Education of Kazakhstan, project no. 0115PK00546.
Presented by the member of Editorial Board: A. A. Lazarev

Received: 22.05.2015
English version:
Automation and Remote Control, 2017, Volume 78, Issue 3, Pages 425–434
DOI: https://doi.org/10.1134/S0005117917030043
Bibliographic databases:
Document Type: Article
Language: Russian
Citation: Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov, “Genetic local search and hardness of approximation for the server load balancing problem”, Avtomat. i Telemekh., 2017, no. 3, 51–62; Autom. Remote Control, 78:3 (2017), 425–434
Citation in format AMSBIB
\Bibitem{KocPanPly17}
\by Yu.~A.~Kochetov, A.~A.~Panin, A.~V.~Plyasunov
\paper Genetic local search and hardness of approximation for the server load balancing problem
\jour Avtomat. i Telemekh.
\yr 2017
\issue 3
\pages 51--62
\mathnet{http://mi.mathnet.ru/at14731}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3666085}
\elib{https://elibrary.ru/item.asp?id=28960578}
\transl
\jour Autom. Remote Control
\yr 2017
\vol 78
\issue 3
\pages 425--434
\crossref{https://doi.org/10.1134/S0005117917030043}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000396338200004}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85014934824}
Linking options:
  • https://www.mathnet.ru/eng/at14731
  • https://www.mathnet.ru/eng/at/y2017/i3/p51
    • This publication is cited in the following 4 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Avtomatika i Telemekhanika
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024