The quickest path problem consists of finding a path in a directed network to transmit a given amount σ of items from a source node to a sink node with minimal transmission time, where the transmission time depends on the traversal times τ and the capacities u of the arcs. We suppose that there exist more than one quickest path and finds a quickest path with a special property...
