Paper Info
Title
The quickest path problem with interval lead times
Abstract
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.
Year
DOI
Venue
2004
10.1016/S0305-0548(02)00197-1
Computers & OR
Keywords
DocType
Volume
quickest path problem,interval transmission time,bicriteria shortest path problem,arc capacity,order relation,real line,lead time,interval lead time,decision maker
Journal
31
Issue
ISSN
Citations 
3
Computers and Operations Research
5
PageRank 
References 
Authors
0.47
7
1
Name
Order
Citations
PageRank
Herminia I. Calvete126121.37