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, 1999, Volume 6, Number 1, Pages 12–32 (Mi da333)  

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

The behavior of probabilistic greedy algorithms for a multistage location problem

E. N. Goncharov, Yu. A. Kochetov


Full text: PDF file (1872 kB)

Bibliographic databases:
UDC: 519.854.33
Received: 30.10.1998
Revised: 10.03.1999

Citation: E. N. Goncharov, Yu. A. Kochetov, “The behavior of probabilistic greedy algorithms for a multistage location problem”, Diskretn. Anal. Issled. Oper., Ser. 2, 6:1 (1999), 12–32

Citation in format AMSBIB
\Bibitem{GonKoc99}
\by E.~N.~Goncharov, Yu.~A.~Kochetov
\paper The behavior of probabilistic greedy algorithms for a~multistage location problem
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 1999
\vol 6
\issue 1
\pages 12--32
\mathnet{http://mi.mathnet.ru/da333}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=1767830}
\zmath{https://zbmath.org/?q=an:0931.90001}


Linking options:
  • http://mi.mathnet.ru/eng/da333
  • http://mi.mathnet.ru/eng/da/v6/s2/i1/p12

    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. N. Goncharov, Yu. A. Kochetov, “Veroyatnostnyi poisk s zapretami dlya diskretnykh zadach bezuslovnoi optimizatsii”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 9:2 (2002), 13–30  mathnet  mathscinet  zmath
    2. Yu. A. Kochetov, A. A. Stolyar, “Ispolzovanie chereduyuschikhsya okrestnostei dlya priblizhennogo resheniya zadachi kalendarnogo planirovaniya s ogranichennymi resursami”, Diskretn. analiz i issled. oper., ser. 2, ser. 2, 10:2 (2003), 29–55  mathnet  mathscinet  zmath
    3. E. A. Mukhacheva, A. S. Mukhacheva, “The rectangular packing problem: local optimum search methods based on block structures”, Autom. Remote Control, 65:2 (2004), 248–257  mathnet  crossref  mathscinet  zmath  isi
    4. E. Kh. Gimadi, E. N. Goncharov, “Dvukhurovnevaya zadacha vybora sistemy mashin i uzlov s nelineinoi proizvodstvennoi funktsiei”, Sib. zhurn. industr. matem., 9:2 (2006), 44–54  mathnet  mathscinet
    5. Hansen P., Brimberg J., Urosevic D., Mladenovic N., “Primal-dual variable neighborhood search for the simple plant-location problem”, Informs Journal on Computing, 19:4 (2007), 552–564  crossref  mathscinet  zmath  isi  scopus
    6. T. V. Levanova, A. S. Fedorenko, “Lokalnyi poisk s chereduyuschimisya okrestnostyami dlya dvukhstadiinoi zadachi razmescheniya”, Diskretn. analiz i issled. oper., 15:3 (2008), 43–57  mathnet  mathscinet  zmath
    7. Vorontsovskii A.V., Dikarev A.Yu., Akhobadze T.D., “Primenenie imitatsionnogo modelirovaniya dlya obosnovaniya investitsionnykh programm v usloviyakh neopredelennosti”, Finansy i biznes, 2009, no. 3, 135–151  elib
  • Дискретный анализ и исследование операций
    Number of views:
    This page:544
    Full text:193

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