MATH  E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shmoys, editors. The traveling salesman problem: A guided tour of combinatorial optimization. John Wiley & Sons, New York, 0000.MATH  S. Lin and B.W. Kernighan. An effective heuristic algorithm for the traveling-salesman problem. Operations Research, 00:000-000, 0000.MathSciNetCrossRefMATH  N. Maculan. The Steiner problem in graphs. Annals of Discrete Mathematics, 00:000-000, 0000.MathSciNetMATH  S. Martello and P. Toth. Knapsack problems: Algorithms and computer implementations. John Wiley & Sons, New York, 0000.MATH  Z. Michalewicz. Genetic algorithms + Data structures = Evolution programs. Springer, Berlin, 0000.CrossRefMATH  N. Mladenović and P. Hansen. Variable neighborhood search. Computers & Operations Research, 00:0000-0000, 0000.MathSciNetCrossRef00000-0)MATH  N.J. Nilsson. Problem-solving methods in artificial intelligence. McGraw-Hill, New York, 0000.  N.J. Nilsson. Principles of artificial intelligence. Springer, Berlin, 0000.CrossRefMATH  P.M. Pardalos and J. Xue. The maximum clique problem. Journal of Global Optimization, 0:000-000, 0000.MathSciNetCrossRefMATH  J. Pearl. Heuristics: Intelligent search strategies for computer problem solving. Addison-Wesley, Reading, 0000.  L.S. Pitsoulis. Topics in matroid theory. SpringerBriefs in Optimization. Springer, 0000.CrossRefMATH  L.S. Pitsoulis and M.G.C. Resende. Greedy randomized adaptive search procedures. In P.M. Pardalos and M.G.C. Resende, editors, Handbook of applied optimization, pages 000-000. Oxford University Press, New York, 0000.  C. Reeves and J.E. Rowe. Genetic algorithms: Principles and perspectives. Springer, Berlin, 0000.  C.R. Reeves. Modern heuristic techniques for combinatorial problems. Blackwell, London, 0000.MATH  M.G.C. Resende and J.L. González-Velarde. GRASP: Procedimientos de búsqueda miope aleatorizado y adaptativo. Inteligencia Artificial, 00: 00-00, 0000.  M.G.C. Resende and C.C. Ribeiro. Greedy randomized adaptive search procedures. In F. Glover and G. Kochenberger, editors, Handbook of metaheuristics, pages 000-000. Kluwer Academic Publishers, Boston, 0000b.  M.G.C. Resende and C.C. Ribeiro. GRASP with path-relinking: Recent advances and applications. In T. Ibaraki, K. Nonobe, and M. Yagiura, editors, Metaheuristics: Progress as real problem solvers, pages 00-00. Springer, New York, 0000a.  M.G.C. Resende and C.C. Ribeiro. Greedy randomized adaptive search procedures: Advances and applications. In M. Gendreau and J.-Y. Potvin, editors, Handbook of metaheuristics, pages 000-000. Springer, New York, 0nd edition, 0000.  M.G.C. Resende and C.C. Ribeiro. GRASP: Greedy randomized adaptive search procedures. In E.K. Burke and G. Kendall, editors, Search methodologies: Introductory tutorials in optimization and decision support systems, chapter 00, pages 000-000. Springer, New York, 0nd edition, 0000.  M.G.C. Resende and R.M.A. Silva. GRASP: Procedimentos de busca gulosos, aleatórios e adaptativos. In H.S. Lopes, L.C.A. Rodrigues, and M.T.A. Steiner, editors, Meta-heurísticas em pesquisa operacional, chapter 0, pages 0-00. Omnipax Editora, Curitiba, 0000.  M.G.C. Resende, G.R. Mateus, and R.M.A. Silva. GRASP: Busca gulosa, aleatorizada e adaptativa. In A. Gaspar-Cunha, R. Takahashi, and C.H. Antunes, editors, Manual da computação evolutiva e metaheurística, pages 000-000. Coimbra University Press, Coimbra, 0000.  C.C. Ribeiro. GRASP: Une métaheuristique gloutonne et probabiliste. In J. Teghem and M. Pirlot, editors, Optimisation approchée en recherche opérationnelle, pages 000-000. Hermès, Paris, 0000.  C.C. Ribeiro, E. Uchoa, and R.F. Werneck. A hybrid GRASP with perturbations for the Steiner problem in graphs. INFORMS Journal on Computing, 00:000-000, 0000.MathSciNetCrossRefMATH  K. Sörensen. Metaheuristics - The metaphor exposed. International Transactions in Operational Research, 00:0-00, 0000