  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  H. Li and D. Landa-Silva. An elitist GRASP metaheuristic for the multi-objective quadratic assignment problem. In M. Ehrgott, C.M. Fonseca, X. Gandibleux, J.-K. Hao, and M. Sevaux, editors, Evolutionary multi-criterion optimization, volume 0000 of Lecture Notes in Computer Science, pages 000-000. Springer, Berlin, 0000.  R. Martí, J.L. González-Velarde, and A. Duarte. Heuristics for the bi-objective path dissimilarity problem. Computers & Operations Research, 00:0000-0000, 0000.CrossRefMATH  R. Martí, M.G.C. Resende, and C.C. Ribeiro. Multi-start methods for combinatorial optimization. European Journal of Operational Research, 000:0-0, 0000a.  R. Martí, V. Campos, M.G.C. Resende, and A. Duarte. Multiobjective GRASP with path relinking. European Journal of Operational Research, 000:00-00, 0000.MathSciNetCrossRefMATH  S.L. Martins, P.M. Pardalos, M.G.C. Resende, and C.C. Ribeiro. A parallel GRASP for the Steiner tree problem in graphs using a hybrid local search strategy. Journal of Global Optimization, 00:000-000, 0000.MathSciNetCrossRefMATH  J.F. Muth and G.L. Thompson. Industrial scheduling