Loading [MathJax]/jax/output/SVG/config.js
Trudy Instituta Matematiki i Mekhaniki UrO RAN
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 Instituta Matematiki i Mekhaniki UrO RAN, 2010, Volume 16, Number 1, Pages 152–170 (Mi timm535)  
This article is cited in 3 scientific papers (total in 3 papers)

One bottleneck routing problem

A. N. Sesekin, A. A. Chentsov, A. G. Chentsov

Institute of Mathematics and Mechanics, Ural Branch of the Russian Academy of Sciences
Full-text PDF (452 kB) Citations (3)
References:
PDF
HTML
Abstract: An extremal routing problem with a criterion that has the sense of the greatest edge length of a polygonal line is considered. It is assumed that the costs at every step (stage) of the travel may depend on a list of tasks that have not been fulfilled by the beginning of this step. In addition, there are constraints in the form of precedence conditions. An economical variant of the procedure is constructed based on the dynamic programming method.
Keywords: routing, precedence conditions.
Received: 30.11.2009
English version:
Proceedings of the Steklov Institute of Mathematics (Supplementary issues), 2011, Volume 272, Issue 1, Pages S165–S185
DOI: https://doi.org/10.1134/S0081543811020131
Bibliographic databases:
Document Type: Article
UDC: 519.6
Language: Russian
Citation: A. N. Sesekin, A. A. Chentsov, A. G. Chentsov, “One bottleneck routing problem”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 1, 2010, 152–170; Proc. Steklov Inst. Math. (Suppl.), 272, suppl. 1 (2011), S165–S185
Citation in format AMSBIB
\Bibitem{SesCheChe10}
\by A.~N.~Sesekin, A.~A.~Chentsov, A.~G.~Chentsov
\paper One bottleneck routing problem
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2010
\vol 16
\issue 1
\pages 152--170
\mathnet{http://mi.mathnet.ru/timm535}
\elib{https://elibrary.ru/item.asp?id=13072997}
\transl
\jour Proc. Steklov Inst. Math. (Suppl.)
\yr 2011
\vol 272
\issue , suppl. 1
\pages S165--S185
\crossref{https://doi.org/10.1134/S0081543811020131}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000289527400013}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-79954613677}
Linking options:
  • https://www.mathnet.ru/eng/timm535
  • https://www.mathnet.ru/eng/timm/v16/i1/p152
    • This publication is cited in the following 3 articles:
    1. Salii Ya.V. Sheka A.S., “Improving Dynamic Programming For Travelling Salesman With Precedence Constraints: Parallel Morin-Marsten Bounding”, Optim. Method Softw., 36:6 (2021), 1128–1154  crossref  isi  scopus
    2. A. A. Chentsov, A. G. Chentsov, P. A. Chentsov, “Elements of dynamic programming in extremal route problems”, Automation and Remote Control, 75:3 (2014), 537–550  mathnet  crossref  isi
    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 On a bottleneck routing problem with internal tasks  elib
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Trudy Instituta Matematiki i Mekhaniki UrO RAN
    Statistics & downloads:
    Abstract page:541
    Full-text PDF :144
    References:112
    First page:3
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025