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

Pierre Coste, Andrea Lodi 0001, Gilles Pesant. Using Cost-Based Solution Densities from TSP Relaxations to Solve Routing Problems. In Louis-Martin Rousseau, Kostas Stergiou 0001, editors, Integration of Constraint Programming, Artificial Intelligence, and Operations Research - 16th International Conference, CPAIOR 2019, Thessaloniki, Greece, June 4-7, 2019, Proceedings. Volume 11494 of Lecture Notes in Computer Science, pages 182-191, Springer, 2019. [doi]

Abstract

Abstract is missing.