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]

@article{BehdaniS14,
  title = {An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem},
  author = {Behnam Behdani and J. Cole Smith},
  year = {2014},
  doi = {10.1287/ijoc.2013.0574},
  url = {http://dx.doi.org/10.1287/ijoc.2013.0574},
  researchr = {https://researchr.org/publication/BehdaniS14},
  cites = {0},
  citedby = {0},
  journal = {INFORMS Journal on Computing},
  volume = {26},
  number = {3},
  pages = {415-432},
}