The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions

[1]  Paola Festa.  Complexity analysis and optimization of the shortest path tour problem , 2012, Optim. Lett..

[2]  Rommel Dias Saraiva,et al.  An integer linear programming model for the constrained shortest path tour problem , 2018, Electron. Notes Discret. Math..

[3]  Demetrio Laganà,et al.  Solving the shortest path tour problem , 2013, Eur. J. Oper. Res..

[4]  Mauricio G. C. Resende,et al.  Grasp: An Annotated Bibliography , 2002 .

[5]  Roberto Cordone,et al.  A heuristic approach to the overnight security service problem , 2003, Comput. Oper. Res..

[6]  Daniele Ferone,et al.  A biased-randomized simheuristic for the distributed assembly permutation flowshop problem with stochastic processing times , 2017, Simul. Model. Pract. Theory.

[7]  Federica Laureana,et al.  On the Forward Shortest Path Tour Problem , 2017 .

[8]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part Ii: Applications , 2022 .

[9]  Daniele Ferone,et al.  An efficient exact approach for the constrained shortest path tour problem , 2020, Optim. Methods Softw..

[10]  Mauricio G. C. Resende,et al.  GRASP with path relinking heuristics for the antibandwidth problem , 2011, Networks.

[11]  Francesco Carrabs,et al.  A reduction heuristic for the all-colors shortest path problem , 2021, RAIRO Oper. Res..

[12]  Daniele Ferone,et al.  The constrained shortest path tour problem , 2016, Comput. Oper. Res..

[13]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[14]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Suboptimal Control: A Survey from ADP to MPC , 2005, Eur. J. Control.

[15]  Raffaele Cerulli,et al.  A two-level metaheuristic for the all colors shortest path problem , 2018, Comput. Optim. Appl..

[16]  Lionel Amodeo,et al.  Multi-start iterated local search for the periodic vehicle routing problem with time windows and time spread constraints on services , 2014, Comput. Oper. Res..

[17]  Alan A. Bertossi,et al.  The Edge Hamiltonian Path Problem is NP-Complete , 1981, Inf. Process. Lett..

[18]  C. P. Bajaj,et al.  Some constrained shortest-route problems , 1971, Unternehmensforschung.

[19]  Maria Grazia Speranza,et al.  A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks , 2013, Networks.

[20]  M. Resende,et al.  A GRASP for graph planarization , 1997 .

[21]  Lucio Bianco,et al.  Operations Research Models for Global Route Planning in Hazardous Material Transportation , 2013 .

[22]  Mauricio G. C. Resende,et al.  An Annotated Bibliography of Grasp Part I: Algorithms , 2022 .

[23]  Daniele Ferone,et al.  Shortest path tour problem with time windows , 2020, Eur. J. Oper. Res..

[24]  M. Resende,et al.  A probabilistic heuristic for a computationally difficult set covering problem , 1989 .