P335: Enumeration of all constrained quickest paths in a network

P335: Enumeration of all constrained quickest paths in a network

Input:

A network $N = (V, E)$ and constraints $L$ and $C$.

Output:

All quickest paths in $N$.

Complexity:

$O(k|V|^2|E|)$ total time.

Comment:

$k$ is the number of solutions. A quickest path is a variant of a shortest path.

Reference:

[Gen-Huey1994] (Bibtex)