An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem

Francesco Carrabs, Carmine Cerrone, Raffaele Cerulli, Bruce L. Golden. An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. INFORMS Journal on Computing, 32(4):1030-1048, 2020. [doi]

@article{CarrabsCCG20,
  title = {An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem},
  author = {Francesco Carrabs and Carmine Cerrone and Raffaele Cerulli and Bruce L. Golden},
  year = {2020},
  doi = {10.1287/ijoc.2020.0962},
  url = {https://doi.org/10.1287/ijoc.2020.0962},
  researchr = {https://researchr.org/publication/CarrabsCCG20},
  cites = {0},
  citedby = {0},
  journal = {INFORMS Journal on Computing},
  volume = {32},
  number = {4},
  pages = {1030-1048},
}