Di Puglia Pugliese, Luigi; Guerriero, Francesca - In: European Journal of Operational Research 227 (2013) 2, pp. 254-267
This paper addresses the elementary shortest path problem with forbidden paths. The main aim is to find the shortest paths from a single origin node to every other node of a directed graph, such that the solution does not contain any path belonging to a given set (i.e., the forbidden set). It is...