RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PERSONAL OFFICE
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


Avtomat. i Telemekh., 2012, Issue 3, Pages 134–149 (Mi at3783)  

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

Applications of Mathematical Programming

On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs

A. G. Chentsov

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences, Ekaterinburg, Russia

Abstract: Consideration was given to a scheme for solving the extremal routing problem constrained by the precedence conditions and based on a modification of the dynamic programming method. Attention was focused on an issue related with parallelization of the procedure of constructing the Bellman function layers. A hypothetical construction for distribution of the space of positions between the processors such that they can run without any data exchange until the final stage of computations was proposed.

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

English version:
Automation and Remote Control, 2012, 73:3, 532–546

Bibliographic databases:

Document Type: Article
Presented by the member of Editorial Board: A. I. Kibzun

Received: 06.06.2011

Citation: A. G. Chentsov, “On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs”, Avtomat. i Telemekh., 2012, no. 3, 134–149; Autom. Remote Control, 73:3 (2012), 532–546

Citation in format AMSBIB
\Bibitem{Che12}
\by A.~G.~Chentsov
\paper On a~parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs
\jour Avtomat. i Telemekh.
\yr 2012
\issue 3
\pages 134--149
\mathnet{http://mi.mathnet.ru/at3783}
\transl
\jour Autom. Remote Control
\yr 2012
\vol 73
\issue 3
\pages 532--546
\crossref{https://doi.org/10.1134/S0005117912030113}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000301791500011}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84862142583}


Linking options:
  • http://mi.mathnet.ru/eng/at3783
  • http://mi.mathnet.ru/eng/at/y2012/i3/p134

    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
    Cycle of papers

    This publication is cited in the following articles:
    1. A. G. Chentsov, P. A. Chentsov, “Marshrutizatsiya peremeschenii s ogranicheniyami i nestatsionarnymi funktsiyami stoimosti”, Nauchno-tekhnicheskie vedomosti sankt-peterburgskogo gosudarstvennogo politekhnicheskogo universiteta. informatika. telekommunikatsii. upravlenie = st. petersburg state polytechnical university journal. computer science. telecommunications and control systems, 4:152 (2012), 88–93  elib
    2. A. G. Chentsov, “K voprosu o marshrutizatsii kompleksov rabot”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2013, no. 1, 59–82  mathnet
    3. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in extremal route problems”, Autom. Remote Control, 75:3 (2014), 537–550  mathnet  crossref  isi
    4. A. G. Chentsov, A. A. Chentsov, “Dynamic programming in the routing problem with constraints and costs depending on a list of tasks”, Dokl. Math., 88:3 (2013), 637–640  crossref  mathscinet  zmath  isi  elib  scopus
    5. A. G. Chentsov, A. A. Chentsov, “Route problem with constraints depending on a list of tasks”, Dokl. Math., 92:3 (2015), 685–688  crossref  mathscinet  zmath  isi  scopus
    6. A. A. Chentsov, A. G. Chentsov, “Obobschennaya model kurera s dopolnitelnymi ogranicheniyami”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 9:1 (2016), 46–58  mathnet  crossref  elib
    7. A. A. Chentsov, A. G. Chentsov, “Generalized model of courier with additional restrictions”, Bull. South Ural State U. Ser.-Math Model Program Comput., 9:1 (2016), 46–58  mathscinet  zmath  isi
    8. 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
    9. A. A. Petunin, A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in local improvement constructions for heuristic solutions of routing problems with constraints”, Autom. Remote Control, 78:4 (2017), 666–681  mathnet  crossref  isi  elib
    10. A. G. Chentsov, A. A. Chentsov, A. M. Grigorev, “Ob odnoi zadache marshrutizatsii, modeliruyuschei peremescheniya v radiatsionnykh polyakh”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 27:4 (2017), 540–557  mathnet  crossref  elib
    11. A. G. Chentsov, A. M. Grigoryev, A. A. Chentsov, “Solving a routing problem with the aid of an independent computations scheme”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 11:1 (2018), 60–74  mathnet  crossref  elib
    12. A. G. Chentsov, P. A. Chentsov, “Optimizatsiya tochki starta v zadache posledovatelnogo obkhoda megapolisov pri nalichii uslovii predshestvovaniya”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 11:2 (2018), 83–95  mathnet  crossref  elib
    13. V. V. Zakharov, A. V. Mugaiskikh, “Dinamicheskaya adaptatsiya geneticheskogo algoritma marshrutizatsii transporta na bolshikh setyakh”, UBS, 73 (2018), 108–133  mathnet
    14. A. G. Chentsov, A. A. Chentsov, A. N. Sesekin, “Dinamicheskoe programmirovanie v obobschennoi zadache «na uzkie mesta» i optimizatsiya tochki starta”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 28:3 (2018), 348–363  mathnet  crossref  elib
    15. 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
    16. Chentsov A.A., Chentsov A.G., Sesekin A.N., “Generalized a Bottleneck Routing Problem: Dynamic Programming and the Start Point Optimization”, IFAC PAPERSONLINE, 51:32 (2018), 373–377  crossref  isi
    17. A. G. Chentsov, A. M. Grigorev, “Optimiziruyuschie multivstavki v zadachakh marshrutizatsii s ogranicheniyami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 28:4 (2018), 513–530  mathnet  crossref  elib
  • Avtomatika i Telemekhanika
    Number of views:
    This page:219
    Full text:29
    References:26
    First page:25

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