.png){kind=icon}
返回
Finding the K shortest hyperpaths
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2003.11.014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The K shortest paths problem has been extensively studied for many years. Efficient methods have been devised, and many practical applications are known. Shortest hyperpath models have been proposed for several problems in different areas, for example in relation with routing in dynamic networks. However. the K shortest hyperpaths problem has not yet been investigated. In this paper we present procedures for finding the K shortest hyperpaths in a directed hypergraph. This is done by extending existing algorithms for K shortest loopless paths. Computational experiments on the proposed procedures are performed, and applications in transportation. planning and combinatorial optimization are discussed. (C) 2003 Elsevier Ltd. All rights reserved.
Keyword:
network programming
directed hypergraphs
K shortest hyperpaths
K shortest paths
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
.png){kind=icon}
A weighted cooperative spectrum sensing framework for infrastructure-based cognitive radio networks
PREAI
分享收藏An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions
OAAI
OAAI分享收藏
查看更多内容