A comprehensive survey on the quickest path problem

A comprehensive survey on the quickest path problem

0.00 Avg rating0 Votes
Article ID: iaor20072039
Country: Germany
Volume: 147
Issue: 1
Start Page Number: 5
End Page Number: 21
Publication Date: Oct 2006
Journal: Annals of Operations Research
Authors: , ,
Abstract:

This work is a survey on a special minsum–maxmin bicriteria problem, known as the quickest path problem, that can model the transmission of data between two nodes of a network. Moreover, the authors review the problems of ranking the K quickest paths, and the K quickest loopless paths, and compare them in terms of the worst-case complexity order. The classification presented led to the proposal of a new variant of a known K quickest loopless paths algorithm. Finally, applications of quickest path algorithms are mentioned, as well as some comparative empirical results.

Reviews

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