Skip to main content
Log in

Route problem with constraints depending on a list of tasks

  • Mathematics
  • Published:
Doklady Mathematics Aims and scope Submit manuscript

Abstract

An additive route problem with preceding conditions is considered in which the cost function and the move constraints both depend on a list of tasks that have not been performed by the current time. The problem is solved by applying a dynamic programming method that takes into account both these factors and is implemented in the construction of a (generally) incomplete array of Bellman function values.

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

Access this article

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

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. I. I. Melamed, S. I. Sergeev, and I. Kh. Sigal, Autom. Remote Control 50 (9), 1147–1173 (1989).

    MATH  MathSciNet  Google Scholar 

  2. G. Gutin and A. P. Punnen, The Traveling Salesman Problem and Its Variations (Kluwer, London, 2002).

    MATH  Google Scholar 

  3. V. D. Frolovskii, Inf. Tekhnol. Proekt. Proizvodstve, No. 4, 63–66 (2005).

    Google Scholar 

  4. A. A. Petunin, Vestn. Ufim. Gos. Aviats. Tekh. Univ., Ser. Upr. Vychisl. Tekhnol. Inf. 13 (2), 280–286 (2009).

    Google Scholar 

  5. A. G. Chentsov, Dokl. Math. 78 (3), 859–863 (2008).

    Article  MATH  MathSciNet  Google Scholar 

  6. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, Izv. Vyssh. Uchebn. Zaved. Mat., No. 6, 64–81 (2010).

    MathSciNet  Google Scholar 

  7. A. A. Chentsov and A. G. Chentsov, Dokl. Math. 88 (3), 637–640 (2013).

    Article  MATH  MathSciNet  Google Scholar 

  8. A. G. Chentsov, Autom. Remote Control 75 (4), 728–744 (2014).

    Article  MATH  MathSciNet  Google Scholar 

  9. V. V. Korobkin, A. N. Sesekin, O. L. Tashlykov, and A. G. Chentsov, Routing Methods and Their Applications to the Enhancement of Safety and Efficiency of Nuclear Plant Operation (Novye Tekhnologii, Moscow, 2012) [in Russian].

    Google Scholar 

  10. K. Kuratowski and A. Mostowski, Set Theory (NorthHolland, Amsterdam, 1967; Mir, Moscow, 1970).

    MATH  Google Scholar 

  11. J. A. Dieudonne, Foundations of Modern Analysis (Academic, New York, 1960; Mir, Moscow, 1964).

    MATH  Google Scholar 

  12. A. G. Chentsov, Extremal Routing and Assignment Problems: Theoretical Issues (NITs “Regulyarnaya i Khaoticheskaya dinamika,” Moscow, 2008) [in Russian].

    Google Scholar 

  13. A. G. Chentsov, Autom. Remote Control 73 (3), 532–546 (2012).

    Article  MATH  MathSciNet  Google Scholar 

  14. A. G. Chentsov, Vestn. Udmurt. Gos. Univ., No. 1, 58–82 (2013).

    Google Scholar 

  15. A. A. Chentsov, A. G. Chentsov, and P. A. Chentsov, Autom. Remote Control 75 (3), 537–550 (2014).

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to A. G. Chentsov.

Additional information

Original Russian Text © A.G. Chentsov, A.A. Chentsov, 2015, published in Doklady Akademii Nauk, 2015, Vol. 465, No. 2, pp. 154–158.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chentsov, A.G., Chentsov, A.A. Route problem with constraints depending on a list of tasks. Dokl. Math. 92, 685–688 (2015). https://doi.org/10.1134/S1064562415060083

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Navigation