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

Referencias
[1] E. Aarts and J.K. Lenstra, Local Search in Combinatorial Optimization, (John Wiley & Sons, New
York, 1997).
[2] R.K. Ahuja, J.B. Orlin, and D. Sharma, New neighborhood search structures for the capacitated
minimum spanning tree problem, Research Report 99-2, Department of Industrial & Systems
Engineering, University of Florida, 1999.
[3] V. Aggarwal, V.G. Tikekar, and Lie-Fer Hsu, Bottleneck assignment problem under categorization,
Computers and Operations Research 13 (1986) 11-26.
[4] D. Applegate, R. Bixby, V. Chvatal, and W. Cook, On the solution of traveling salesman problems,
Documenta Mathematica, Extra volume ICM (1998), 645-656.
[5] S. Arnborg and A. Proskurowski, Linear time algorithms for NP-hard problems restricted to partial
k-trees, Discrete Applied Mathematics 23 (1989), 11-24.
[6] R. E. Burkard, V. G. Deineko, and G. J. Woeginger, The travelling salesman problem and the PQtree,
in: Proc. IPCO V, Lecture Notes in Computer Science, Vol. 1084 (Springer, 1996) 490-504.
[7] R.E. Burkard and V.G. Deineko, Polynomially solvable cases of the traveling salesman problem and
a new exponential neighborhood, Computing 54 (1995) 191-211.
[8] J. Carlier and P. Villon, A new heuristic for the traveling salesman problem, RAIRO - Operations
Research 24 (1990) 245-253.
[9] R.K. Congram, C.N. Potts, S. L. van de Velde, An iterated dynasearch algorithm for the single
machine total weighted tardiness scheduling problem, paper in preparation, 1998.
[10] G. Cornuejols, D. Naddef, and W.R. Pulleyblank, Halin graphs and the traveling salesman problem,
Mathematical Programming 26 (1983) 287-294.
[11] G. A. Croes, A method for solving traveling-salesman problems, Operations Research 6 (1958)
791-812.
[12] V. Deineko and G.J. Woeginger, A study of exponential neighborhoods for the traveling salesman
problem and the quadratic assignment problem, Report Woe-05, Technical University Graz, 1997.
[13] U. Dorndorf and E. Pesch, Fast clustering algorithms, ORSA Journal of Computing 6 (1994) 141-
153.
[14] K.A. Dowsland, Nurse scheduling with tabu search and strategic oscillation, European Journal of
Operations Research 106 (1998) 393-407.
[15] M. Dror and L. Levy, A vehicle routing improvement algorithm comparison of a “greedy” and a
“matching” implementation for inventory routing, Computers and Operations Research 13 (1986) 3345.
31
[16] A.E. Dunlop and B.W. Kernighan, A procedure for placement of standard cell VLSI circuits, IEEE
Transactions on Computer-Aided Design 4 (1985) 92-98.
34