An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem

Behnam Behdani, J. Cole Smith. An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem. INFORMS Journal on Computing, 26(3):415-432, 2014. [doi]

Authors

Behnam Behdani

This author has not been identified. Look up 'Behnam Behdani' in Google

J. Cole Smith

This author has not been identified. Look up 'J. Cole Smith' in Google