Author:
Grymin Radosław,Bożejko Wojciech,Pempera Jarosław
Publisher
Springer International Publishing
Reference14 articles.
1. Aarts, E.H.L., van Laarhoven, P.J.M.: Simulated annealing: a pedestrian review of the theory and some applications. In: Devijver P.A., Kittler J. (eds.) Pattern Recognition Theory and Applications. NATO ASI Series (Series F: Computer and Systems Sciences), vol. 30. Springer, Berlin (1987)
2. Bożejko, W., Wodecki, M.: Parallel evolutionary algorithm for the traveling salesman problem. J. Numer. Anal. Ind. Appl. Math. 2(3–4), 129–137 (2007)
3. Byrd, R.H., Lu, P., Nocedal, J.: A limited memory algorithm for bound constrained optimization. SIAM J. Sci. Comput. 16(5), 1190–1208 (1995)
4. Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)
5. Englert, M., Röglin, H., Vöcking, B.: Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. Algorithmica 68(1), 190–264 (2014)