1. The close enough traveling salesman problem: A discussion of several heuristics;Gulczynski,2006
2. W. Mennell, B. Golden, E. Wasil, A steiner-zone heuristic for solving the close-enough traveling salesman problem, in: 2th INFORMS Computing Society Conference: Operations Research, Computing, and Homeland Defense, Monterey, California, January 9–11, 2011, pp. 1–23.
3. A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissance;Di Placido;Comput. Oper. Res.,2022
4. Robot path planning by traveling salesman problem with circle neighborhood: Modeling, algorithm, and applications;Nedjati;Ind. Eng.,2020
5. Heuristics for Solving Three Routing Problems: Close-Enough Traveling Salesman Problem, Close-Enough Vehicle Routing Problem, and Sequence-Dependent Team Orienteering Problem;Mennell,2009