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)

Open Acess document at official publisher

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering
Research Center:	CIRRELT - Interuniversity Research Centre on Enterprise Networks, Logistics and Transportation
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
DOI:	10.5220/0003698702330238
Official URL:	https://doi.org/10.5220/0003698702330238
Date Deposited:	18 Apr 2023 15:11
Last Modified:	20 Aug 2025 10:58

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. https://doi.org/10.5220/0003698702330238
APA 7 (HTML)ASCII CitationAtomBibTeXDOIsDublin CoreEndNote (.ENW)MARC (ISO 2709/UTF-8) (.MRC)MARC (UTF-8) (.MRK8)MARC XMLMPEG-21 DIDLMultiline CSVOAI-ORE Resource Map (Atom Format)OPENAIREOpenURL ContextObjectOpenURL ContextObject in SpanRDF+N-TriplesRDF+N3RDF+XMLReferReference Manager (.RIS)Simple Metadata

Statistics

Repository Staff Only