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

DOI10.1007/978-3-030-19212-9_12MaRDI QIDQ2327249zbMATH OpenOpenAlexFDO

Authors Pierre Coste, Andrea Lodi, 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

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

Recommendations

• scientific article; zbMATH DE number 1947373
• New state-space relaxations for solving the traveling salesman problem with time windows
• Embedding relaxations in global constraints for solving TSP and TSPTW
• scientific article; zbMATH DE number 1873286
• scientific article; zbMATH DE number 2159169

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2327249)