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

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Izv. Vyssh. Uchebn. Zaved. Mat.:
Year:
Volume:
Issue:
Page:
Find






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


Izv. Vyssh. Uchebn. Zaved. Mat., 2010, Number 6, Pages 64–81 (Mi ivm6946)  

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

An extremal constrained routing problem with internal losses

A. A. Chentsov, A. G. Chentsov, P. A. Chentsov

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

Abstract: We consider the following problem: one has to visit a finite number of sets and perform certain work on each of them. The work is accompanied by certain (internal) losses. The movements from some set to another one are constrained and accompanied by external (aggregated additively) losses. We propose a “through” variant of the dynamic programming method, formulate an equivalent reconstruction problem, and develop an optimal algorithm based on an efficient dynamic programming method technique.

Keywords: dynamic programming, precedence conditions, reconstruction problem.

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

English version:
Russian Mathematics (Izvestiya VUZ. Matematika), 2010, 54:6, 54–68

Bibliographic databases:

UDC: 519.6
Received: 25.05.2008

Citation: A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “An extremal constrained routing problem with internal losses”, Izv. Vyssh. Uchebn. Zaved. Mat., 2010, no. 6, 64–81; Russian Math. (Iz. VUZ), 54:6 (2010), 54–68

Citation in format AMSBIB
\Bibitem{CheCheChe10}
\by A.~A.~Chentsov, A.~G.~Chentsov, P.~A.~Chentsov
\paper An extremal constrained routing problem with internal losses
\jour Izv. Vyssh. Uchebn. Zaved. Mat.
\yr 2010
\issue 6
\pages 64--81
\mathnet{http://mi.mathnet.ru/ivm6946}
\mathscinet{http://www.ams.org/mathscinet-getitem?mr=2779423}
\transl
\jour Russian Math. (Iz. VUZ)
\yr 2010
\vol 54
\issue 6
\pages 54--68
\crossref{https://doi.org/10.3103/S1066369X10060071}
\scopus{http://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-78649563735}


Linking options:
  • http://mi.mathnet.ru/eng/ivm6946
  • http://mi.mathnet.ru/eng/ivm/y2010/i6/p64

    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. M. Grigorev, E. E. Ivanko, A. G. Chentsov, “Dinamicheskoe programmirovanie v obobschennoi zadache kurera s vnutrennimi rabotami: elementy parallelnoi struktury”, Model. i analiz inform. sistem, 18:3 (2011), 101–124  mathnet
    2. A. G. Chentsov, “On a parallel procedure for constructing the Bellman function in the generalized problem of courier with internal jobs”, Autom. Remote Control, 73:3 (2012), 532–546  mathnet  crossref  isi
    3. I. B. Cheblokov, A. G. Chentsov, “Ob odnoi zadache marshrutizatsii s vnutrennimi rabotami”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2012, no. 1, 96–119  mathnet
    4. A. A. Chentsov, A. G. Chentsov, “Ob odnoi zadache marshrutizatsii s vnutrennimi rabotami”, Tr. IMM UrO RAN, 18, no. 1, 2012, 298–317  mathnet  elib
    5. Yu. I. Berdyshev, “O nekotorykh zadachakh vybora ocherednosti sblizheniya upravlyaemoi sistemy s gruppoi ob'ektov”, Tr. IMM UrO RAN, 18, no. 3, 2012, 56–66  mathnet  elib
    6. A. A. Chentsov, A. G. Chentsov, “On an iterative procedure for solving a routing problem with constraints”, Proc. Steklov Inst. Math. (Suppl.), 283, suppl. 1 (2013), 24–45  mathnet  crossref  isi  elib
    7. A. G. Chentsov, P. A. Chentsov, “Ob odnoi nestatsionarnoi zadache marshrutizatsii s ogranicheniyami”, Model. i analiz inform. sistem, 19:4 (2012), 5–24  mathnet
    8. Grigorev A.M., Ivanko E.E., Knyazev S.T., Chentsov A.G., “Dinamicheskoe programmirovanie v obobschennoi zadache kurera, oslozhnennoi vnutrennimi rabotami”, Mekhatronika, avtomatizatsiya, upravlenie, 2012, no. 7, 14–21  elib
    9. Salii Ya.V., Chentsov A.G., “Ob odnoi marshrutnoi zadache na uzkie mesta s vnutrennimi rabotami”, Vestnik tambovskogo universiteta. seriya: estestvennye i tekhnicheskie nauki, 17:3 (2012), 827–847  elib
    10. Chentsov A.G., Chentsov P.A., “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
    11. A. G. Chentsov, “Odna parallelnaya protsedura postroeniya funktsii Bellmana v obobschennoi zadache kurera s vnutrennimi rabotami”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 2012, no. 12, 53–76  mathnet
    12. A. G. Chentsov, “K voprosu o marshrutizatsii kompleksov rabot”, Vestn. Udmurtsk. un-ta. Matem. Mekh. Kompyut. nauki, 2013, no. 1, 59–82  mathnet
    13. A. G. Chentsov, P. A. Chentsov, “Ob odnom nestatsionarnom variante obobschennoi zadachi kurera s vnutrennimi rabotami”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 6:2 (2013), 88–107  mathnet
    14. 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
    15. Chentsov A.A., Chentsov A.G., “Dynamic Programming in the Routing Problem With Complex Dependence of Costs on the List of Jobs”, J. Comput. Syst. Sci. Int., 53:2 (2014), 172–185  crossref  mathscinet  zmath  isi  elib
    16. Chentsov A.G., Chentsov A.A., “Route Problem With Constraints Depending on a List of Tasks”, Dokl. Math., 92:3 (2015), 685–688  crossref  mathscinet  zmath  isi  elib
    17. 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
  • Известия высших учебных заведений. Математика Russian Mathematics (Izvestiya VUZ. Matematika)
    Number of views:
    This page:439
    Full text:67
    References:50
    First page:8

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