Skip to main content
SpringerLink
Log in

On a bottleneck routing problem

  • Published:
Proceedings of the Steklov Institute of Mathematics Aims and scope Submit manuscript

Abstract

An extremal routing problem with a criterion that has the sense of the largest 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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. A. A. Chentsov and A. G. Chentsov, Trudy Inst. Mat. Mekh. UrO RAN 14(2), 129 (2008).

    Google Scholar 

  2. I. Kh. Sigal and A. P. Ivanova, Introduction to Applied Discrete Programming (Nauka, Moscow, 2007) [in Russian].

    Google Scholar 

  3. I. I. Melamed, S. I. Sergeev, and I. Kh. Sigal, Avtomat. i Telemekh. 9, 3 (1989).

    Google Scholar 

  4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest, Algorithms: Construction and Analysis (Mosk. Tsentr. Nepreryvn. Mat. Obrazovan., Moscow, 2002) [in Russian].

    Google Scholar 

  5. K. Kuratowski and A. Mostowski, Set Theory (North-Holland, Amsterdam, 1968; Mir, Moscow, 1970).

    MATH  Google Scholar 

  6. A. G. Chentsov, Exremal Routing Problems and Task Distribution: Theoretical Issues (Regulyarn. Khaotich. Dinamika, Izhevsk, 2008) [in Russian].

    Google Scholar 

  7. N. N. Krasovskii, Game Problems on the Encounter of Motions (Nauka, Moscow, 1970) [in Russian].

    Google Scholar 

  8. N. N. Krasovskii and A. I. Subbotin, Positional Differential Games (Nauka, Moscow, 1974) [in Russian].

    MATH  Google Scholar 

  9. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, New York, 1979; Mir, Moscow, 1982).

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Mechanics, Ural Division of the Russian Academy of Sciences, ul. S. Kovalevskoi 16, Yekaterinburg, 620990, Russia

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

Authors
  1. A. N. Sesekin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. G. Chentsov
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to A. N. Sesekin.

Additional information

Original Russian Text © A.N. Sesekin, A.A. Chentsov, A.G.Chentsov, 2010, published in Trudy Instituta Matematiki i Mekhaniki UrO RAN, 2010, Vol. 16, No. 1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Sesekin, A.N., Chentsov, A.A. & Chentsov, A.G. On a bottleneck routing problem. Proc. Steklov Inst. Math. 272 (Suppl 1), 165–185 (2011). https://doi.org/10.1134/S0081543811020131

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0081543811020131

Keywords

Search

Navigation