Estudio de técnicas de búsqueda por vecindad a muy gran escala

[33] G.M. Gutin, On the efficiency of a local algorithm for solving the traveling salesman problem,
Automation and Remote Control No. 11(part 2) (1988) 1514-1519.
[34] G.M. Gutin, Exponential neighborhood local search for the traveling salesman problem, Computers
and Operations Research 26 (1999) 313-320.
[35] G.M. Gutin, and A. Yeo, Polynomial algorithms for the TSP and the QAP with a factorial
domination number, Manuscript, Brunel University, UK, 1998.
[36] G.M. Gutin, and A. Yeo, TSP heuristics with large domination number, Report 12/98, Department
of Mathematics and Statistics, Brunel University, UK, 1998.
[37] G.M. Gutin, and A. Yeo, Small diameter neighborhood graphs for the traveling salesman problem,
Computers and Operations Research 26 (1999) 321-327.
[38] G.M. Gutin, and A. Yeo, TSP tour domination and Hamiltonian cycle decomposition of regular
digraphs, Manuscript, Brunel University, UK, 1999.
[39] K. Helsgaun, An effective implementation of the Lin-Kernighan traveling salesman heuristic,
Manuscript, Roskilde University, Denmark, 1999.
[40] J. Hurink, An exponential neighborhood for a one machine batching problem, University of
Twente, Faculty of Mathematical Sciences, The Netherlands, 1998. To appear in OR-Spektrum 1999.
[41] D.S. Johnson, Local search and the traveling salesman problem, in: Proceedings of 17th
International Colloquium on Automata Languages and Programming, Lecture Notes in Computer
Science, (Springer-Verlag, Berlin, 1990) 443-460.
[42] D.S. Johnson, L.A. McGeoch, The travelling salesman problem: a case study in local optimization,
in: E.H.L Aarts and J.K. Lenstra, eds., Local Search in Combinatorial Optimization, (Wiley, N.Y., 1997)
in press.
[43] R.M. Karp, A patching algorithm for the non-symmetric traveling salesman problem, SIAM Journal
of Computing 8 (1979) 561-573.
[44] B.W. Kernighan and S. Lin, An efficient heuristic procedure for partitioning graphs, Bell System
Technical Journal 49 (1970) 291-307.
[45] P.S. Klyaus, The structure of the optimal solution of certain classes of the traveling salesman
problems, (in Russian), Vestsi Akad. Nauk BSSR, Physics and Math. Sci., Minsk, (1976) 95-98.
33
[46] S. Knust, Optimality conditions and exact neighborhoods for sequencing problems, Universitat
Osnabruck, Fachbereich Mathematik/Informatik, Osnabruck, Germany, 1997.
[47] M. Laguna, J. Kelly, J.L. Gonzales-Velarde, and F. Glover, Tabu search for multilevel generalized
assignment problem, European Journal of Operations Research 82 (1995) 176-189.
[48] E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, eds., The Traveling Salesman
Problem (Wiley, New York, 1985).
[49] S. Lin, Computer solutions to the traveling salesman problem, Bell System Tech. Journal 44 (1965)
36