1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti–Spaccamela, A., Protasi, M.: Complexity and Approximation. Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)
2. Garey, M.R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory on NP–Completeness. W.H. Freeman and Company, New York (1979)
3. Lecture Notes in Computer Science;G.V. Gens,1979
4. Goldberg, D.E., Lingle, R.: Alleles, Loci and the Traveling Salesman Problem. In: Proceedings of the International Conference on Genetic Algorithms, pp. 154–159 (1985)
5. Lecture Notes in Computer Science;A. Leporati,2005