. Princeton University Press, Princeton, 0000.MATH  U. Dorndorf and E. Pesch. Fast clustering algorithms. INFORMS Journal on Computing, 0:000-000, 0000.CrossRefMATH  K. Easton, G. Nemhauser, and M.A. Trick. The travelling tournament problem: Description and benchmarks. In T. Walsh, editor, Principles and practice of constraint programming, volume 0000 of Lecture Notes in Computer Science, pages 000-000. Springer, Berlin, 0000.  M. Gendreau and J.-Y. Potvin, editors. Handbook of metaheuristics. Springer, New York, 0nd edition, 0000.  F. Glover. Tabu Search - Part I. ORSA Journal on Computing, 0:000-000, 0000.MathSciNetCrossRefMATH  F. Glover. Tabu Search - Part II. ORSA Journal on Computing, 0:0-00, 0000.CrossRefMATH  F. Glover. Multilevel tabu search and embedded search neighborhoods for the traveling salesman problem. Technical report, University of Colorado, Boulder, 0000.  F. Glover. Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics