An algorithm for the quickest path problem

An algorithm for the quickest path problem

0.00 Avg rating0 Votes
Article ID: iaor19982976
Country: Netherlands
Volume: 20
Issue: 4
Start Page Number: 195
End Page Number: 198
Publication Date: May 1997
Journal: Operations Research Letters
Authors: ,
Keywords: telecommunications
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.

Reviews

Required fields are marked *. Your email address will not be published.