Email this article Search for C-optimal routes in graphs
- Authors: Bugaev Y.V.1, Chikunov S.V.1, Muzalevskii F.A.1
-
Affiliations:
- Voronezh State University of Engineering Technologies
- Issue: Vol 78, No 11 (2017)
- Pages: 2039-2050
- Section: Intellectual Control Systems, Data Analysis
- URL: https://ogarev-online.ru/0005-1179/article/view/150723
- DOI: https://doi.org/10.1134/S0005117917110091
- ID: 150723
Cite item
Open Access
Access granted
Subscription Access
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.
Keywords
About the authors
Yu. V. Bugaev
Voronezh State University of Engineering Technologies
Author for correspondence.
Email: y_bugaev52@mail.ru
Russian Federation, Voronezh
S. V. Chikunov
Voronezh State University of Engineering Technologies
Email: y_bugaev52@mail.ru
Russian Federation, Voronezh
F. A. Muzalevskii
Voronezh State University of Engineering Technologies
Email: y_bugaev52@mail.ru
Russian Federation, Voronezh
Supplementary files
