Solving the close-enough arc routing problem. Hoang Ha, M., Bostel, N., Langevin, A., & Rousseau, L. Networks, 63(1):107-118, 2014.
Solving the close-enough arc routing problem [link]Paper  bibtex   
@article{ dblp1829161,
  title = {Solving the close-enough arc routing problem},
  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 = {article},
  type = {article},
  year = {2014},
  key = {dblp1829161},
  id = {dblp1829161},
  biburl = {http://www.dblp.org/rec/bibtex/journals/networks/HaBLR14},
  url = {http://dx.doi.org/10.1002/net.21525},
  journal = {Networks},
  pages = {107-118},
  number = {1},
  volume = {63},
  text = {Networks 63(1):107-118 (2014)}
}

Downloads: 0