Search for C-Optimal Routes in Graphs

被引:0
|
作者
Bugaev, Yu. V. [1 ]
Chikunov, S. V. [1 ]
Muzalevskii, F. A. [1 ]
机构
[1] Voronezh State Univ Engn Technol, Voronezh, Russia
关键词
graph; choice function; binary relation; dynamic programming;
D O I
10.1134/S0005117917110091
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
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.
引用
收藏
页码:2039 / 2050
页数:12
相关论文
共 50 条