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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.