Search for C-optimal routes in graphs
- Autores: Bugaev Y.V.1, Chikunov S.V.1, Muzalevskii F.A.1
-
Afiliações:
- Voronezh State University of Engineering Technologies
- Edição: Volume 78, Nº 11 (2017)
- Páginas: 2039-2050
- Seção: Intellectual Control Systems, Data Analysis
- URL: https://ogarev-online.ru/0005-1179/article/view/150723
- DOI: https://doi.org/10.1134/S0005117917110091
- ID: 150723
Citar
Resumo
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.
Palavras-chave
Sobre autores
Yu. Bugaev
Voronezh State University of Engineering Technologies
Autor responsável pela correspondência
Email: y_bugaev52@mail.ru
Rússia, Voronezh
S. Chikunov
Voronezh State University of Engineering Technologies
Email: y_bugaev52@mail.ru
Rússia, Voronezh
F. Muzalevskii
Voronezh State University of Engineering Technologies
Email: y_bugaev52@mail.ru
Rússia, Voronezh
Arquivos suplementares
