Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems

Pierre Coste, Andrea Lodi and Gilles Pesant

Paper (2019)

An external link is available for this item

Department:	Department of Mathematics and Industrial Engineering Department of Computer Engineering and Software Engineering
PolyPublie URL:	https://publications.polymtl.ca/43585/
Conference Title:	16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019)
Conference Location:	Thessaloniki, Greece
Conference Date(s):	2019-06-04 - 2019-06-07
Publisher:	Springer Verlag
DOI:	10.1007/978-3-030-19212-9_12
Official URL:	https://doi.org/10.1007/978-3-030-19212-9_12
Date Deposited:	18 Apr 2023 15:01
Last Modified:	25 Sep 2024 16:30

Cite in APA 7:	Coste, P., Lodi, A., & Pesant, G. (2019, June). Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems [Paper]. 16th International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR 2019), Thessaloniki, Greece. https://doi.org/10.1007/978-3-030-19212-9_12
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)Répertoire des publications (EndNote)Simple Metadata

Statistics

Repository Staff Only