Search for C-optimal routes in graphs


如何引用文章

全文:

开放存取 开放存取
受限制的访问 ##reader.subscriptionAccessGranted##
受限制的访问 订阅存取

详细

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.

作者简介

Yu. Bugaev

Voronezh State University of Engineering Technologies

编辑信件的主要联系方式.
Email: y_bugaev52@mail.ru
俄罗斯联邦, Voronezh

S. Chikunov

Voronezh State University of Engineering Technologies

Email: y_bugaev52@mail.ru
俄罗斯联邦, Voronezh

F. Muzalevskii

Voronezh State University of Engineering Technologies

Email: y_bugaev52@mail.ru
俄罗斯联邦, Voronezh

补充文件

附件文件
动作
1. JATS XML

版权所有 © Pleiades Publishing, Ltd., 2017