<  Back to the Polytechnique Montréal portal

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: 05 Apr 2024 11:41
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

Statistics

Dimensions

Repository Staff Only

View Item View Item