1. Some NP-complete geometric problems;Garey;Proc. 8th SIGACT Symp. on the Theory of Computing,1976
2. The probabilistic analysis of some combinatorial search algorithms;Karp,1976
3. A computationally efficient heuristic for the traveling salesman problem;Stewart;Proc. 13th Ann. Meeting of S.E. TIMS,1977
4. Approximate traveling salesman algorithms;Golden;Oper. Res.,1980
5. The traveling salesman problem: A survey;Bellmore;Oper. Res.,1968