An algorithm for the quickest path problem

Authors:
Ernesto De Queirós Vieira Martins;José Luis Esteves Dos Santos
Affiliations:
-;-
Venue:
Operations Research Letters
Year:
1997

Citing 2
Cited 6

Fibonacci heaps and their uses in improved network optimization algorithms

Journal of the ACM (JACM)
The quickest path problem

Computers and Operations Research

Extend the quickest path problem to the system reliability evaluation for a stochastic-flow network

Computers and Operations Research
A label-setting algorithm for finding a quickest path

Computers and Operations Research
An algorithm for ranking quickest simple paths

Computers and Operations Research
Optimal pair of minimal paths under both time and budget constraints

IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Min-Max quickest path problems

Networks
A Reference Point Approach for the Resource Constrained Shortest Path Problems

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The quickest path problem arises when transmitting a given amount of data between two given nodes of a network, a lead time and a capacity (per unit of time) being assigned to each arc in the network. In this paper the problem is regarded as a bicriteria path problem, allowing the use of a very efficient algorithm which solves the quickest path problem for all possible values of the amount of data that has to be transmitted.