Search for C-optimal routes in graphs
- 作者: Bugaev Y.V.1, Chikunov S.V.1, Muzalevskii F.A.1
- 
							隶属关系: 
							- Voronezh State University of Engineering Technologies
 
- 期: 卷 78, 编号 11 (2017)
- 页面: 2039-2050
- 栏目: Intellectual Control Systems, Data Analysis
- URL: https://journals.rcsi.science/0005-1179/article/view/150723
- DOI: https://doi.org/10.1134/S0005117917110091
- ID: 150723
如何引用文章
详细
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						
补充文件
 
				
			 
						 
						 
					 
						 
						 
				 
  
  
  
  
  电邮这篇文章
			电邮这篇文章  开放存取
		                                开放存取 ##reader.subscriptionAccessGranted##
						##reader.subscriptionAccessGranted## 订阅存取
		                                		                                        订阅存取
		                                					