Author:
Caballero-Morales Santiago Omar,Bonilla-Enriquez Gladys,Sanchez-Partida Diana
Publisher
Springer Nature Switzerland
Reference41 articles.
1. An, H.C., Shmoys, D.B.: LP-Based Approximation Algorithms for Traveling Salesman Path Problems, pp. 1–13 (2011)
2. Arigliano, A., Calogiuri, Y., Ghiani, G., Guerriero, E.: A branch-and-bound algorithm for the time-dependent travelling salesman problem. Networks 72(3), 382–392 (2018)
3. Beale, M.H., Hagan, M.T., Demuth, H.B.: Neural Network Toolbox 7 User’s Guide. The MathWorks Inc., Massachusetts, United States (2010)
4. Burke, L.I., Damany, P.: The guilty net for the traveling salesman problem. Comput. Oper. Res. 19(3/4), 255–265 (1992)
5. Caballero-Morales, S.O., Martinez-Flores, J.L., Sanchez-Partida, D.: Dynamic reduction-expansion operator to improve performance of genetic algorithms for the traveling salesman problem. Math. Probl. Eng. 2018(2), 1–12 (2018)