Solving the shortest path tour problem

Aneja, 1983, Shortest chain subject to side constraints, Networks, 13, 295, 10.1002/net.3230130212 Bertsekas, 2005, vol. I Bertsekas, 1991 Bertsekas, 1993, A simple and fast label correcting algorithm for shortest paths, Networks, 23, 703, 10.1002/net.3230230808 Cherkassky, 1996, Shortest path algorithms: theory and experimental evaluation, Mathematical Programming, 73, 129, 10.1007/BF02592101 Cormen, 2001 Dijkstra, 1959, A note on two problems in connexion with graphs, Numerical Mathematics, 1, 269, 10.1007/BF01386390 L. Di Puglia Pugliese, F. Guerriero, Shortest path problem with forbidden paths: the elementary version, European Journal of Operational Research 227 (2) (2013) 254–267. Di Puglia Pugliese, 2013, Dynamic programming approaches to solve the shortest paths problem with forbidden paths, Optimization Methods and Software, 28, 221, 10.1080/10556788.2011.630077 Dumitrescu, 2001, Algorithms for the weight constrained shortest path problem, International Transactions in Operational Research, 8, 15, 10.1111/1475-3995.00003 Dumitrescu, 2003, Improved preprocessing, labeling and scaling algorithms for the weight-constrained shortest path problem, Networks, 42, 135, 10.1002/net.10090 Feillet, 2004, An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems, Networks, 44, 216, 10.1002/net.20033 Festa, 2012, Complexity analysis and optimization of the shortest path tour problem, Optimization Letters, 6, 163, 10.1007/s11590-010-0258-y P. Festa, S. Pallottino, A Pseudo-Random Networks Generator, Technical Report, Department of Mathematics and Applications R. Caccioppoli, University of Napoli FEDERICO II, Italy, 2003. Floyd, 1962, Algorithm 97: shortest path, Communications of the ACM, 5, 345, 10.1145/367766.368168 Guerriero, 2001, A class of label-correcting methods for the K shortest paths problem, Operations Research, 49, 423, 10.1287/opre.49.3.423.11217 Hunt, 1996, An efficient algorithm for concurrent priority queue heaps, Information Processing Letters, 60, 151, 10.1016/S0020-0190(96)00148-2 Klingman, 1974, NETGEN-A program for generating large scale (un)capacitated assignment, transportation and minimum cost flow network problems, Management Science, 20, 814, 10.1287/mnsc.20.5.814 Muhandiramge, 2009, Simultaneous solution of Lagrangean dual problems interleaved with preprocessing for the weight constrained shortest path problem, Networks, 53, 358, 10.1002/net.20292 Righini, 2008, New dynamic programming algorithms for the resource constrained elementary shortest path problem, Networks, 51, 155, 10.1002/net.20212