Skip to main content
SpringerLink
Log in

Search for C-optimal routes in graphs

  • Intellectual Control Systems, Data Analysis
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We propose search algorithms for paths in graphs that are optimal in the sense of a given choice function. As an example we consider the choice mechanism with respect to a binary relation that does not contain numerical criterial estimates.

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. Vovk, S.P., Analysis of Model Parameters for Fuzzy Dynamical Programming, Izv. Vyssh. Uchebn. Zaved., Elektromekh., 2004, no. 5, pp. 70–72.

    Google Scholar 

  2. Kogan, D.I., Zadachi i metody konechnomernoi optimizatsii: Uchebn. pos., ch. 3: Dinamicheskoe programmirovanie i diskretnaya mnogokriterial’naya optimizatsiya (Problems and Methods of Finite- Dimensional Optimization. Textbook, vol. 3: Dynamical Programming and Discrete Multicriterial Optimization), Nizhny Novgorod: NGU im. Lobachevskogo, 2004.

    Google Scholar 

  3. Mazurenko, S.S., Dynamic Programming in Systems with States Represented as Distributions, Vestn. Mosk. Gos. Univ., Ser. 15, Vychisl. Mat. Kibern., 2011, vol. 3, pp. 30–38.

    MathSciNet  Google Scholar 

  4. Struchenkov, V.I., Dynamic Programming with Pareto Sets, Diskret. Anal. Issled. Oper., 2008, vol. 15, no. 6, pp. 58–81.

    MathSciNet  MATH  Google Scholar 

  5. Bugaev, Yu.V and Chikunov, S.V., Generalization of the Dynamic Programming Scheme, Autom. Remote Control, 2009, vol. 70, no. 2, pp. 253–262.

    Article  MathSciNet  MATH  Google Scholar 

  6. Lipski, W., Kombinatoryka dla programistov (Combinatorics for Programmers), Warszawa: WNT, 1982. Translated unter the title Kombinatorika dlya programmistov, Moscow: Mir, 1988.

    Google Scholar 

  7. Yudin, D.B., Vychislitel’nye metody teorii prinyatiya reshenii (Computational Methods of Decision Making Theory), Moscow: Nauka, 1989.

    MATH  Google Scholar 

  8. Plott, C.B., Path Independence, Rationality and Social Choice, Econometrica, 1973, vol. 41, no. 6, pp. 1075–1091.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Voronezh State University of Engineering Technologies, Voronezh, Russia

    Yu. V. Bugaev, S. V. Chikunov & F. A. Muzalevskii

Authors
  1. Yu. V. Bugaev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. S. V. Chikunov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. F. A. Muzalevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yu. V. Bugaev.

Additional information

Original Russian Text © Yu.V. Bugaev, S.V. Chikunov, F.A. Muzalevskii, 2017, published in Avtomatika i Telemekhanika, 2017, No. 11, pp. 122–136.w

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bugaev, Y.V., Chikunov, S.V. & Muzalevskii, F.A. Search for C-optimal routes in graphs. Autom Remote Control 78, 2039–2050 (2017). https://doi.org/10.1134/S0005117917110091

Download citation

  • Received:

  • Published:

  • Issue Date:

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

Keywords

Search

Navigation