The following publications are possibly variants of this publication:
- A novel discretization scheme for the close enough traveling salesman problemFrancesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Manlio Gaudioso. cor, 78:163-171, 2017. [doi]
- Improved Upper and Lower Bounds for the Close Enough Traveling Salesman ProblemFrancesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Ciriaco D'Ambrosio. GPC 2017: 165-177 [doi]
- Estimating the Tour Length for the Close Enough Traveling Salesman ProblemDebdatta Sinha Roy, Bruce L. Golden, Xingyin Wang, Edward A. Wasil. algorithms, 14(4):123, 2021. [doi]
- An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman ProblemFrancesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden. informs, 32(4):1030-1048, 2020. [doi]
- A Steiner Zone Variable Neighborhood Search Heuristic for the Close-Enough Traveling Salesman ProblemXingyin Wang, Bruce L. Golden, Edward A. Wasil. cor, 101:200-219, 2019. [doi]
- A genetic algorithm for the close-enough traveling salesman problem with application to solar panels diagnostic reconnaissanceAndrea Di Placido, Claudia Archetti, Carmine Cerrone. cor, 145:105831, 2022. [doi]