RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Probl. Upr.:
Year:
Volume:
Issue:
Page:
Find






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


Probl. Upr., 2013, Issue 5, Pages 12–21 (Mi pu808)  

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

Mathematical problems in management

Elements of dynamic programming in extremal route problems

A. A. Chentsovab, A. G. Chentsovab, P. A. Chentsovba

a Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg
b Ural Federal University, Ekaterinburg

Abstract: The paper considers the routing problem of visiting megalopolises, that is complicated by constraints in the form of precedence conditions and work within megalopolises; it is assumed that the cost function may depend on the job list. It is noted that the application of the theory may be associated with the task of disassembly the decommissioned nuclear plant. In this problem, the cost of moving depends on the list of outstanding tasks: not removed pieces of equipment emit. It is shown that the computational difficulty of the constructed algorithms requires the use of parallel structure elements.

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

English version:
Automation and Remote Control, 2014, 75:3, 537–550

Bibliographic databases:

Document Type: Article
UDC: 519.6

Citation: A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in extremal route problems”, Probl. Upr., 2013, no. 5, 12–21; Autom. Remote Control, 75:3 (2014), 537–550

Citation in format AMSBIB
\Bibitem{CheCheChe13}
\by A.~A.~Chentsov, A.~G.~Chentsov, P.~A.~Chentsov
\paper Elements of dynamic programming in extremal route problems
\jour Probl. Upr.
\yr 2013
\issue 5
\pages 12--21
\mathnet{http://mi.mathnet.ru/pu808}
\transl
\jour Autom. Remote Control
\yr 2014
\vol 75
\issue 3
\pages 537--550
\crossref{https://doi.org/10.1134/S0005117914030102}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000332738300010}


Linking options:
  • http://mi.mathnet.ru/eng/pu808
  • http://mi.mathnet.ru/eng/pu/v5/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. A. G. Chentsov, “Bellmanovskie vstavki v zadache marshrutizatsii s ogranicheniyami i uslozhnennymi funktsiyami stoimosti”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2014, no. 4, 122–141  mathnet
    2. A. G. Chentsov, M. Yu. Khachai, M. Yu. Khachai, “An exact algorithm with linear complexity for a problem of visiting megalopolises”, Proc. Steklov Inst. Math. (Suppl.), 295, suppl. 1 (2016), 38–46  mathnet  crossref  mathscinet  isi  elib
    3. A. G. Chentsov, A. A. Chentsov, “Zadacha marshrutizatsii, oslozhnennaya zavisimostyu funktsii stoimosti i “tekuschikh” ogranichenii ot spiska zadanii”, Model. i analiz inform. sistem, 23:2 (2016), 211–227  mathnet  crossref  mathscinet  elib
    4. A. G. Chentsov, P. A. Chentsov, “Routing under constraints: problem of visit to megalopolises”, Autom. Remote Control, 77:11 (2016), 1957–1974  mathnet  crossref  isi  elib  elib
    5. A. G. Chentsov, “Optimiziruyuschie vstavki v zadachakh marshrutizatsii i ikh realizatsiya na osnove dinamicheskogo programmirovaniya”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 26:4 (2016), 565–578  mathnet  crossref  mathscinet  elib
    6. A. G. Chentsov, A. A. Chentsov, “A discrete-continuous routing problem with precedence conditions”, Proc. Steklov Inst. Math. (Suppl.), 300, suppl. 1 (2018), 56–71  mathnet  crossref  crossref  isi  elib
    7. Alexander G. Chentsov, Alexey M. Grigoriev, Alexey A. Chentsov, “Optimizing the starting point in a precedence constrained routing problem with complicated travel cost functions”, Ural Math. J., 4:2 (2018), 43–55  mathnet  crossref  elib
  • Проблемы управления
    Number of views:
    This page:243
    Full text:38
    References:34
    First page:12

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