An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. Hoang Ha, M., Bostel, N., Langevin, A., & Rousseau, L. In Proceedings of International Conference on Operations Research and Enterprise Systems (ICORES), pages 233-238, 2012.
bibtex   
@inproceedings{ dblp2215819,
  title = {An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints},
  author = {Minh Hoang Ha and Nathalie Bostel and André Langevin and Louis-Martin Rousseau},
  author_short = {Hoang Ha, M. and Bostel, N. and Langevin, A. and Rousseau, L.},
  bibtype = {inproceedings},
  type = {inproceedings},
  year = {2012},
  key = {dblp2215819},
  id = {dblp2215819},
  biburl = {http://www.dblp.org/rec/bibtex/conf/icores/HaBLR12},
  url = {},
  conference = {ICORES},
  pages = {233-238},
  text = {ICORES 2012:233-238},
  booktitle = {Proceedings of International Conference on Operations Research and Enterprise Systems (ICORES)}
}

Downloads: 0