1. Christofides, N.: Worst-Case analysis of a new heuristic for the traveling salesman problem. Technical Report, GSIA, Carnegie Mellon University (1976)
2. Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations. In: Miller, R.E., Thatcher, J.W. (eds.), Pluner, NY (1972)
3. Aarts, E., Lenstra, J.K.: Local search in combinatorial optimization. John Wiley and Sons, Chichester (1997)
4. Johnson, D.S., McGeoch, L.A.: The traveling salesman problem: a case study in Local Optimization. In: Aarts, E., Lenstra, J.K. (eds.) Local search in combinatorial optimization, John Wiley and Sons, Chichester (1997)
5. Ehrgott, M.: Multicriteria Optimization, Lecture Notes in Economics and Mathematical Systems, vol. 491. Springer, Heidelberg (2000)