1. R.M. Karp, Reducibility among combinatorial problems, in:Complexity of Computer Computations, ed. R.E. Miller and J.W. Thatcher (Plenum Press, New York, 1972).
2. M.R. Garey and D.S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness (Freeman, San Francisco, 1979).
3. C.R. Reeves,Modern Heuristic Techniques for Combinatorial Problems (Blackwell Scientific, Oxford, 1993).
4. D.E. Goldberg and R. Lingle, Alleles, loci and the travelling salesman problem, in [32] (1985).
5. J.J. Grefenstette, Incorporating problem-specific knowledge into genetic algorithms, in:Genetic Algorithms and Simulated Annealing, ed. L. Davis (Morgan Kaufmann, Los Altos, CA, 1987).