.png){kind=icon}
返回
A directed hypergraph model for random time dependent shortest paths
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(99)00259-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We consider routing problems in dynamic networks where are travel times are both random and time dependent. The problem of finding the best route to a fixed destination is formulated in terms of shortest hyperpaths on a suitable time-expanded directed hypergraph. The latter problem can be solved in linear time, with respect to the size of the hypergraph, for several definitions of hyperpath length. Different criteria for ranking routes can be modeled by suitable definitions of hyperpath length. We also show that the problem becomes intractable if a constraint on the route structure is imposed. (C) 2000 Elsevier Science B.V. All rights reserved.
Keyword:
network programming
random, time-dependent, shortest paths
directed hypergraphs
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
Vitamin D Status Does Not Affect Disability Progression of Patients with Multiple Sclerosis over Three Year Follow-Up.png)
PLOS ONE
OAAI
PLOS ONEIF0
OAAI分享收藏THE FASTEST PATH THROUGH A NETWORK WITH RANDOM TIME-DEPENDENT TRAVEL-TIMES通过具有随机时间相关旅行时间的网络的最快路径
PREAI
分享收藏
没有更多内容
没有更多内容