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]

Abstract

Abstract is missing.