Pascoal, Marta M.B.; Sedeño-Noda, Antonio - In: European Journal of Operational Research 221 (2012) 2, pp. 308-316
We address the problem of finding the K best paths connecting a given pair of nodes in a directed acyclic graph (DAG) with arbitrary lengths. One of the main results in this paper is the proof that a tree representing the kth shortest path is obtained by an arc exchange in one of the previous...