RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive
Impact factor
Subscription

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find






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


Diskretn. Anal. Issled. Oper., Ser. 2, 2007, Volume 14, Number 1, Pages 3–31 (Mi da53)  

This article is cited in 11 scientific papers (total in 11 papers)

Генетический локальный поиск для задачи о $p$-медиане с предпочтениями клиентов

E. V. Alekseeva, Yu. A. Kochetov

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences

Full text: PDF file (342 kB)
References: PDF file   HTML file

Bibliographic databases:
UDC: 519.85
Received: 26.01.2007
Revised: 17.05.2007

Citation: E. V. Alekseeva, Yu. A. Kochetov, “Генетический локальный поиск для задачи о $p$-медиане с предпочтениями клиентов”, Diskretn. Anal. Issled. Oper., Ser. 2, 14:1 (2007), 3–31

Citation in format AMSBIB
\Bibitem{AleKoc07}
\by E.~V.~Alekseeva, Yu.~A.~Kochetov
\paper Генетический локальный поиск для задачи о $p$-медиане с~предпочтениями клиентов
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2007
\vol 14
\issue 1
\pages 3--31
\mathnet{http://mi.mathnet.ru/da53}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2392667}
\zmath{https://zbmath.org/?q=an:1249.90136}


Linking options:
  • http://mi.mathnet.ru/eng/da53
  • http://mi.mathnet.ru/eng/da/v14/s2/i1/p3

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles

    This publication is cited in the following articles:
    1. V. L. Beresnev, “Upper bounds for goal functions of discrete competitive facility location problems”, J. Appl. Industr. Math., 3:4 (2009), 419–432  mathnet  crossref  mathscinet  zmath
    2. I. L. Vasiliev, K. B. Klimentova, “A branch and bound method for the facility location problem with customer preferences”, J. Appl. Industr. Math., 4:3 (2010), 441–454  mathnet  crossref  mathscinet  zmath
    3. A. V. Kononov, Yu. A. Kochetov, A. V. Plyasunov, “Competitive facility location models”, Comput. Math. Math. Phys., 49:6 (2009), 994–1009  mathnet  crossref  zmath  isi
    4. I. L. Vasiliev, K. B. Klimentova, Yu. A. Kochetov, “New lower bounds for the facility location problem with clients' preferences”, Comput. Math. Math. Phys., 49:6 (2009), 1010–1020  mathnet  crossref  zmath  isi
    5. Klimentova K.B., “Prilozhenie zadachi o -mediane s predpochteniyami klientov dlya klasternogo analiza kletok raka”, Sovremennye tekhnologii. Sistemnyi analiz. Modelirovanie, 2009, no. 3, 33–38  elib
    6. Gruzdeva T.V., Klimentova K.B., “Metod otsechenii dlya neravenstv klik v zadache razmescheniya s predpochteniyami klientov”, Sovremennye tekhnologii. Sistemnyi analiz. Modelirovanie, 2011, no. 4, 31–39  elib
    7. Vasilyev I., Klimentova X., Boccia M., “Polyhedral Study of Simple Plant Location Problem with Order”, Oper. Res. Lett., 41:2 (2013), 153–158  crossref  mathscinet  zmath  isi  elib  scopus
    8. V. V. Petukhov, V. V. Kulibaba, “Regionalnaya informatsionno-analiticheskaya sistema monitoringa oborota tverdykh bytovykh otkhodov”, Tr. SPIIRAN, 25 (2013), 338–349  mathnet
    9. Camacho-Vallejo J.-F., Eduardo Cordero-Franco A., Gonzalez-Ramirez R.G., “Solving the Bilevel Facility Location Problem Under Preferences by a Stackelberg-Evolutionary Algorithm”, Math. Probl. Eng., 2014, 430243  crossref  mathscinet  isi  elib  scopus
    10. Yu. A. Kochetov, A. A. Panin, A. V. Plyasunov, “Genetic local search and hardness of approximation for the server load balancing problem”, Autom. Remote Control, 78:3 (2017), 425–434  mathnet  crossref  mathscinet  isi  elib
    11. Casas-Ramirez M.-S., Camacho-Vallejo J.-F., “Solving the P-Median Bilevel Problem With Order Through a Hybrid Heuristic”, Appl. Soft. Comput., 60 (2017), 73–86  crossref  isi  scopus
  • Дискретный анализ и исследование операций
    Number of views:
    This page:503
    Full text:163
    References:45

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2020