|
Avtomatika i Telemekhanika, 2017, Issue 11, Pages 122–136
(Mi at14928)
|
|
|
|
Intellectual Control Systems, Data Analysis
Search for $C$-optimal routes in graphs
Yu. V. Bugaev, S. V. Chikunov, F. A. Muzalevskii Voronezh State University of Engineering Technologies, Voronezh, Russia
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:
graph, choice function, binary relation, dynamic programming.
Citation:
Yu. V. Bugaev, S. V. Chikunov, F. A. Muzalevskii, “Search for $C$-optimal routes in graphs”, Avtomat. i Telemekh., 2017, no. 11, 122–136; Autom. Remote Control, 78:11 (2017), 2039–2050
Linking options:
https://www.mathnet.ru/eng/at14928 https://www.mathnet.ru/eng/at/y2017/i11/p122
|
Statistics & downloads: |
Abstract page: | 157 | Full-text PDF : | 37 | References: | 37 | First page: | 17 |
|