MATH  M.R. Garey and D.S. Johnson. Computers and intractability. Freeman, San Francisco, 0000.MATH  M. Gendreau and J.-Y. Potvin, editors. Handbook of metaheuristics. Springer, New York, 0nd edition, 0000.  F. Glover and G. Kochenberger, editors. Handbook of metaheuristics. Kluwer Academic Publishers, Boston, 0000.MATH  F. Glover and M. Laguna. Tabu search. Kluwer Academic Publishers, Boston, 0000.CrossRefMATH  D.E. Goldberg. Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, 0000.MATH  M. Grötschel, L. Lovász, and A. Schrijver. Polynomial algorithms for perfect graphs. Annals of Discrete Mathematics, 00:000-000, 0000.MathSciNetMATH  H.H. Hoos and T. Stützle. Stochastic local search: Foundations and applications. Elsevier, New York, 0000.MATH  D.S. Johnson. Near-optimal bin-packing algorithms. PhD thesis, Massachusetts Institute of Technology, Cambridge, 0000.  D.S. Johnson. Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences, 0:000-000, 0000.MathSciNetCrossRef00000-0)MATH  R.M. Karp. Reducibility among combinatorial problems. In R.E. Miller and J.W. Thatcher, editors, Complexity of computer computations. Plenum Press, New York, 0000.  R.M. Karp. On the computational complexity of combinatorial problems. Networks