1. Fügenschuh, A.: Parametrized greedy heuristics in theory and practice. In: Aguilera, M., Blum, C., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics. Second International Workshop, HM 2005, Barcelona, pp. 21–31 (2005)
2. Fügenschuh, A., Martin, A.: Computational integer programming and cutting planes. In: Aardal, R.W.K., Nemhauser, G. (eds.) Handbook on Discrete Optimization. Series Handbooks in Operations Research and Management Science, vol. 12, pp. 69–122. Elsevier, Amsterdam (2005)
3. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H Freeman and Company, New York (1979)
4. Gavish, B., Graves, S.: The traveling salesman problem and related problems. In: Technical Report, OR 078–78, Operations Research Center, Massachusetts Institute of Technology, Cambridge (1978)
5. Helvig, C., Robins, G., Zelikovsky, A.: Moving-target TSP and related problems. In: Bilardi, A.P.G., Italiano, G.F., Pucci, G. (eds.) Proceedings of the European Symposium on Algorithms. Lecture Notes in Computer Science, vol. 1461, pp. 453–464. Springer Verlag, Berlin (1998)