External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints

Minh Hoang Ha, Nathalie Bostel, André Langevin, Louis-Martin Rousseau. An Exact Algorithm for the Close Enough Traveling Salesman Problem with Arc Covering Constraints. In Carlos J. Luz, Fernando Valente, editors, ICORES 2012 - Proceedings of the 1st International Conference on Operations Research and Enterprise Systems, Vilamoura, Algarve, Portugal, 4-6 February, 2012. pages 233-238, SciTePress, 2012.

Abstract

Abstract is missing.

runs on