Graph theory in operations research/ Boffey

x, 301 hal.: ill.; 26 cm

A comprehensive survey on the quickest path problem

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

Location of paths on trees with minimal eccentricity and superior section

Central Paths, Superior Section, Bircirterion Problem, 90B06, 90B80,

Multiobjective routing problems

Hazardous materials, Efficient Solutions, k-Shortest Path Methods,