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, 2010, Volume 16, Number 3, Pages 240–264 (Mi timm597)  

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

Routing with an abstract function of travel cost aggregation

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

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

Abstract: An extremal routing problem with a criterion corresponding to an abstract function of payoff aggregation at individual travel stages is considered.

Keywords: routing, dynamic programming method, precedence conditions.

Full text: PDF file (327 kB)
References: PDF file   HTML file
UDC: 519.6
Received: 19.04.2010

Citation: A. N. Sesekin, A. A. Chentsov, A. G. Chentsov, “Routing with an abstract function of travel cost aggregation”, Trudy Inst. Mat. i Mekh. UrO RAN, 16, no. 3, 2010, 240–264

Citation in format AMSBIB
\Bibitem{SesCheChe10}
\by A.~N.~Sesekin, A.~A.~Chentsov, A.~G.~Chentsov
\paper Routing with an abstract function of travel cost aggregation
\serial Trudy Inst. Mat. i Mekh. UrO RAN
\yr 2010
\vol 16
\issue 3
\pages 240--264
\mathnet{http://mi.mathnet.ru/timm597}
\elib{http://elibrary.ru/item.asp?id=15173485}


Linking options:
  • http://mi.mathnet.ru/eng/timm597
  • http://mi.mathnet.ru/eng/timm/v16/i3/p240

    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. 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
    2. 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:205
    Full text:56
    References:36
    First page:3

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