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. Martello and P. Toth. Knapsack problems: Algorithms and computer implementations. John Wiley & Sons, New York, 0000.MATH  G.R. Mateus, M.G.C. Resende, and R.M.A. Silva. GRASP with path-relinking for the generalized quadratic assignment problem. Journal of Heuristics, 00: 000-000, 0000.CrossRefMATH  K. Melhorn. A faster approximation algorithm for the Steiner problem in graphs. Information Processing Letters, 00:000-000, 0000.MathSciNetCrossRef00000-