Referências: |
1. AARTS, E., Krost, J. H. M. Simulated Annealing and Boltzmann Machine, Wiley, Chichester, 1989.
2. BAASE, S. Computers Algorithms: introduction to design and analysis, Addison-Wesley, 1978.
3. BRASSARD, G. E Bratley, P. Fundamentals of Algorithmics, Prentice-Hall, 1996.
4. CORMEN, T. H., Leiserson, C. E. e Rivest, R. L. Introduction to Algorithms, McGraw-Hill, New York, 1990.
5. GAREY, M. e Johnson, D. S. Computers and Intractability: a guide to the theory of NP-completeness, W. H. Freeman and Company, 1979.
6. GLOVER, F. e Laguna, M. Tabu Search, Kluwer Academics Publishers, Norwell, MA, 1997.
7. GLOVER, F. e Kochenberger, G. A. (eds.) Handbook of Metahueristics, Kluwer Academics, 2003.
8. MANBER, U. Algorithms: a creative approach, Addison-Wesley, 1989.
9. OSMAN, I. H. e Kelly, J. P. (eds.) Meta-Heuristics: Theory and Applications, Kluwer, Boston, 1996.
10. REEVES, C. R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, Blackwell, 1993.
11. REEVES, C. R. e Rowe, J. E. Genetic Algorithms: principles and perspectives, Kluwer, Norwell, MA, 2001.
12. RIBEIRO, C. C. e Hansen, P. (eds.) Essays and Surveys in Metaheuristics, Kluwer Academics Publishers, Norwell, MA, 2002.
13. TERADA, R. Desenvolvimento de Algoritmos e Estruturas de Dados, McGraw-Hill do Brasil, 1991.
|