An Integer-Programming-Based Approach to the Close-Enough Traveling Salesman Problem
Published Online:12 Mar 2014https://doi.org/10.1287/ijoc.2013.0574
Supplemental Material
ijoc.2013.0574-sm.pdf (279 KB)
Use this option if you have an account on informs.org or if you want to become an INFORMS member
Member LoginApril 12, 2013 - April 13, 2026
April 12, 2013 - April 13, 2026
Behnam Behdani
[email protected]Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
J. Cole Smith
[email protected]Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
Behnam Behdani
[email protected]Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
J. Cole Smith
[email protected]Department of Industrial and Systems Engineering, University of Florida, Gainesville, Florida 32611
ijoc.2013.0574-sm.pdf (279 KB)

Copyright © 2014, INFORMS
