  M.G.C. Resende. Metaheuristic hybridization with greedy randomized adaptive search procedures. In Zhi-Long Chen and S. Raghavan, editors, Tutorials in Operations Research, pages 000-000. INFORMS, 0000.  M.G.C. Resende and C.C. Ribeiro. A GRASP with path-relinking for private virtual circuit routing. Networks, 00:000-000, 0000a.  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. Restart strategies for GRASP with path-relinking heuristics. Optimization Letters, 0:000-000, 0000.MathSciNetCrossRefMATH  M.G.C. Resende and R.F. Werneck. A hybrid heuristic for the p-median problem. Journal of Heuristics, 00:00-00, 0000.CrossRefMATH  M.G.C. Resende and R.F. Werneck. A hybrid multistart heuristic for the uncapacitated facility location problem. European Journal of Operational Research, 000:00-00, 0000.MathSciNetCrossRefMATH  M.G.C. Resende, R. Martí, M. Gallego, and A. Duarte. GRASP and path relinking for the max-min diversity problem. Computers & Operations Research, 00: 000-000, 0000a.  M.G.C. Resende, C.C. Ribeiro, F. Glover, and R. Martí. Scatter search and path-relinking: Fundamentals, advances, and applications. In M. Gendreau and J.-Y. Potvin, editors, Handbook of metaheuristics, pages 00-000. Springer, New York, 0nd edition, 0000b.  C.C. Ribeiro and M.G.C. Resende. Path-relinking intensification methods for stochastic local search algorithms. Journal of Heuristics, 00:000-000, 0000.CrossRef  C.C. Ribeiro and I. Rosseti. A parallel GRASP heuristic for the 0-path network design problem. In B. Monien and R. Feldmann, editors, Euro-Par 0000 Parallel Processing, volume 0000 of Lecture Notes in Computer Science, pages 000-000. Springer, Berlin, 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  F.J. Rodriguez, C. Blum, C. García-Martínez, and M. Lozano. GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times. Annals of Operations Research, 000:000-000, 0000.MathSciNetCrossRefMATH  D.P. Ronconi and L.R.S. Henriques. Some heuristic algorithms for total tardiness minimization in a flowshop with blocking. Omega