<  Back to the Polytechnique Montréal portal

An exact algorithm for the close enough traveling salesman problem with arc covering constraints

Minh Hoang Ha, Nathalie Bostel, André Langevin and Louis-Martin Rousseau

Paper (2012)

This item is not archived in PolyPublie
Department: Department of Mathematics and Industrial Engineering
PolyPublie URL: https://publications.polymtl.ca/15312/
Conference Title: 1st International Conference on Operations Research and Enterprise Systems (ICORES 2012)
Conference Location: Vilamoura, Algarve, Portugal
Conference Date(s): 2012-02-04 - 2012-02-06
Date Deposited: 18 Apr 2023 15:11
Last Modified: 25 Sep 2024 15:52
Cite in APA 7: Ha, M. H., Bostel, N., Langevin, A., & Rousseau, L.-M. (2012, February). An exact algorithm for the close enough traveling salesman problem with arc covering constraints [Paper]. 1st International Conference on Operations Research and Enterprise Systems (ICORES 2012), Vilamoura, Algarve, Portugal.

Statistics

Stats are not available on this system.

Repository Staff Only

View Item View Item