| Article ID: | iaor20043286 |
| Country: | United Kingdom |
| Volume: | 31 |
| Issue: | 3 |
| Start Page Number: | 383 |
| End Page Number: | 395 |
| Publication Date: | Mar 2004 |
| Journal: | Computers and Operations Research |
| Authors: | Calvete Herminia I. |
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 time. 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.