.png){kind=icon}
返回
The quickest path problem with interval lead times
.png){kind=icon}
PRE
AI
DOI：10.1016/S0305-0548(02)00197-1.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a version of the quickest path problem is considered in which arc capacities are fixed but lead times are expressed as intervals on real line. By considering order relations that represent the decision maker's preference between interval transmission times, we show that the problem can be solved by transforming it into a sequence of bicriteria, shortest path problems in properly defined networks.
Keyword:
quickest path
transmission time
interval number
bicriteria shortest path problem
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
暂无机构信息
引用论文
Correlation of an Adenine-Specific Conformational Change with the ATP-Dependent Peptidase Activity ofEscherichia coliLon.png)
Biochemistry
BiochemistryIF0
PREAI
分享收藏分享收藏
查看更多内容