| Referências: |
01. M.R. Garey e D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W.H. Freeman
and Company, San Francisco, 1979.
02. C.H. Papadimitriou e K. Steiglitz, Cominatorial Optimization, Prentice-Hall, Englewood Cliffs, 1982.
03. R.E. Campello e N. Maculan, Algoritmos e Heurísticas: Desenvolvimento e Avaliação de Performance, EDUFF, Niterói,
1994.
04. E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan e D.B. Shmoys (editores), The Traveling Salesman Problem, Wiley,
Chichester, 1985.
05. T.H. Cormen, C.E. Leiserson e R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1990.
06. C.R. Reeves (editor), Modern Heuristic Techniques for Combinatorial Problems, Blackwell Scientific Publications, London,
1993.
07. E. Aarts e J.K. Lenstra (editores), Local Search in Combinatorial Optimization, Wiley, 1997.
08. V.J. Rayward-Smith, I.H. Osman, C.R. Reeves e G.D. Smith (editores), Modern Heuristic Search Methods, Wiley, 1996.
09. E. Aarts e J. Korst, Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization
and Neural Computing, Wiley, Chichester, 1989.
10. P.J.M. van Laarhoven e E. Aarts, Simulated Annealing: Theory and Applications, Kluwer Academic Publishers, Dordrecht,
1987.
11. F. Glover e M. Laguna, Tabu Search, Kluwer, Dordrecht, 1997.
12. T. Feo e M.G. Resende, ``Greedy Randomized Adaptive Search Procedures, Journal of Global Optimization 6 (1995),
109-133.
13. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs, Springer- Verlag, Berlin, 1996. |
