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]

Authors

Francesco Carrabs

This author has not been identified. Look up 'Francesco Carrabs' in Google

Carmine Cerrone

This author has not been identified. Look up 'Carmine Cerrone' in Google

Raffaele Cerulli

This author has not been identified. Look up 'Raffaele Cerulli' in Google

Bruce L. Golden

This author has not been identified. Look up 'Bruce L. Golden' in Google