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

MLA

Carrabs, Francesco, et al. “An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.” INFORMS Journal on Computing, vol. 32, no. 4, Fall 2020, pp. 1030–48. EBSCOhost, https://doi.org/10.1287/ijoc.2020.0962.

APA

Carrabs, F., Cerrone, C., Cerulli, R., & Golden, B. (2020). 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. https://doi.org/10.1287/ijoc.2020.0962

Chicago

Carrabs, Francesco, Carmine Cerrone, Raffaele Cerulli, and Bruce Golden. 2020. “An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem.” INFORMS Journal on Computing 32 (4): 1030–48. doi:10.1287/ijoc.2020.0962.