Using cost-based solution densities from TSP relaxations to solve routing problems

DOI10.1007/978-3-030-19212-9_12OpenAlexW2946279428MaRDI QIDQ2327249

Andrea Lodi, Pierre Coste, Gilles Pesant

Publication date: 14 October 2019

Full work available at URL: https://doi.org/10.1007/978-3-030-19212-9_12

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Using cost-based solution densities from TSP relaxations to solve routing problems