1. Garey, M.R., Jhonson, D.S.: Computers and Intractability, a Guide to the Theory of NP-completeness. W. H. Freeman and Company, New York (1979)
2. Merz, P., Freisleben, B.: Fitness Landscapes and Memetic Algorithm Design. New Ideas in Optimization, pp. 245–260. McGraw-Hill Ltd. (1999)
3. Wolpert, D.H., Macready, W.G.: No Free Lunch Theorems for Optimization. IEEE Transactions on Evolutionary Computation 1, 67–82 (1997)
4. Cohen, P.: Empirical Methods for Artificial Intelligence. The MIT Press, Cambridge (1995)
5. Hoos, H.: Stochastic Local Search Methods, Models, Applications, PhD Thesis, Department of Computer Science from Darmstadt University of Technology (1998)