1. The shortest path problem with forbidden paths;Villeneuve;European J Oper Res,2005
2. Ahmed M, Lubiw A. Shortest path avoiding forbidden subpaths. In: Symposium on theoretical aspects of computer science. Freiburg, Germany; 2009. p. 63–74. https://hal.archives-ouvertes.fr/STACS2009/inria-00359710.
3. Finding k shortest looping paths with waiting time in a time–window network;Yang;Appl Math Model,2006
4. Finding K shortest looping paths in a traffic-light network;Yang;Comput Oper Res,2005
5. The igraph software package for complex network research;Csárdi;Inter J Complex Syst,2006