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



Trudy Inst. Mat. i Mekh. UrO RAN:
Year:
Volume:
Issue:
Page:
Find






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


Trudy Inst. Mat. i Mekh. UrO RAN, 2008, Volume 14, Number 2, Pages 129–142 (Mi timm30)  

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

Mathematical Programming

Extremal bottleneck routing problem with constraints in the form of precedence conditions

A. A. Chentsov, A. G. Chentsov


Abstract: An extremal routing problem under constraints in the form of precedence conditions is considered. The quality criterion is the length of the greatest edge of a trajectory. An economical version of a computational procedure based on the dynamic programming method is constructed.

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

English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2008, 263, suppl. 2, S23–S36

Bibliographic databases:

UDC: 519.6
Received: 05.02.2008

Citation: A. A. Chentsov, A. G. Chentsov, “Extremal bottleneck routing problem with constraints in the form of precedence conditions”, Trudy Inst. Mat. i Mekh. UrO RAN, 14, no. 2, 2008, 129–142; Proc. Steklov Inst. Math. (Suppl.), 263, suppl. 2 (2008), S23–S36

Citation in format AMSBIB
\Bibitem{CheChe08}
\by A.~A.~Chentsov, A.~G.~Chentsov
\paper Extremal bottleneck routing problem with constraints in the form of precedence conditions
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2008
\vol 14
\issue 2
\pages 129--142
\mathnet{http://mi.mathnet.ru/timm30}
\zmath{https://zbmath.org/?q=an:1180.90019}
\elib{https://elibrary.ru/item.asp?id=11929735}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2008
\vol 263
\issue , suppl. 2
\pages S23--S36
\crossref{https://doi.org/10.1134/S0081543808060047}
\isi{http://gateway.isiknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=PARTNER_APP&SrcAuth=LinksAMR&DestLinkType=FullRecord&DestApp=ALL_WOS&KeyUT=000208363700003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-60949101580}


Linking options:
  • http://mi.mathnet.ru/eng/timm30
  • http://mi.mathnet.ru/eng/timm/v14/i2/p129

    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. N. Sesekin, A. A. Chentsov, A. G. Chentsov, “One bottleneck routing problem”, Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S165–S185  mathnet  crossref  isi  elib
    2. A. N. Sesekin, A. A. Chentsov, A. G. Chentsov, “Marshrutizatsiya s abstraktnoi funktsiei agregirovaniya stoimostei peremeschenii”, Tr. IMM UrO RAN, 16, no. 3, 2010, 240–264  mathnet  elib
    3. 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
    4. 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
    5. A. G. Chentsov, Ya. V. Salii, “A model of “nonadditive” routing problem where the costs depend on the set of pending tasks”, Vestn. YuUrGU. Ser. Matem. modelirovanie i programmirovanie, 8:1 (2015), 24–45  mathnet  crossref  elib
  • Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Number of views:
    This page:324
    Full text:95
    References:50

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