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, 2005, Volume 12, Issue 2, Pages 44–71 (Mi da91)  

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

On the complexity of local search in the $p$-median problem

Yu. A. Kochetov, M. G. Pashchenko, A. V. Plyasunov

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

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

Bibliographic databases:
UDC: 519.85
Received: 28.10.2004
Revised: 20.10.2005

Citation: Yu. A. Kochetov, M. G. Pashchenko, A. V. Plyasunov, “On the complexity of local search in the $p$-median problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 12:2 (2005), 44–71

Citation in format AMSBIB
\Bibitem{KocPasPly05}
\by Yu.~A.~Kochetov, M.~G.~Pashchenko, A.~V.~Plyasunov
\paper On the complexity of local search in the $p$-median problem
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2005
\vol 12
\issue 2
\pages 44--71
\mathnet{http://mi.mathnet.ru/da91}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2220133}
\zmath{https://zbmath.org/?q=an:1249.90344}


Linking options:
  • http://mi.mathnet.ru/eng/da91
  • http://mi.mathnet.ru/eng/da/v12/s2/i2/p44

    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. E. V. Alekseeva, Yu. A. Kochetov, “Geneticheskii lokalnyi poisk dlya zadachi o $p$-mediane s predpochteniyami klientov”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 14:1 (2007), 3–31  mathnet  mathscinet  zmath
    2. Yu. A. Kochetov, “Computational bounds for local search in combinatorial optimization”, Comput. Math. Math. Phys., 48:5 (2008), 747–763  mathnet  crossref  mathscinet  zmath  isi
    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. A. Davydov, “Lokalnyi poisk s zapretami dlya diskretnoi zadachi o $(r|p)$-tsentroide”, Diskretn. analiz i issled. oper., 19:2 (2012), 19–40  mathnet  mathscinet
    5. Yu. A. Kochetov, A. V. Plyasunov, “Genetic local search the graph partitioning problem under cardinality constraints”, Comput. Math. Math. Phys., 52:1 (2012), 157–167  mathnet  crossref  mathscinet  zmath  adsnasa  isi  elib  elib
    6. G. G. Zabudskii, A. A. Koval', “Solving a maximin location problem on the plane with given accuracy”, Autom. Remote Control, 75:7 (2014), 1221–1230  mathnet  crossref  isi
    7. V. P. Il'ev, S. D. Il'eva, A. A. Navrotskaya, “Approximate solution of the $p$-median minimization problem”, Comput. Math. Math. Phys., 56:9 (2016), 1591–1597  mathnet  crossref  crossref  isi  elib
    8. G. G. Zabudskii, T. I. Keiner, “Optimal placement of rectangles on a plane with fixed objects”, Autom. Remote Control, 78:9 (2017), 1651–1661  mathnet  crossref  isi  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:483
    Full text:143
    References:47

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