A reduction heuristic for the all-colors shortest path problem

DOI10.1051/ro/2020078zbMath1472.90108OpenAlexW3039745085MaRDI QIDQ5002343

Andrea Raiconi, Francesco Carrabs, Raffaele Cerulli

Publication date: 27 July 2021

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2020078

zbMATH Keywords

heuristicequality generalized traveling salesman problemall-colors shortest path problemE-GTSP

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Paths and cycles (05C38)

Related Items (1)

Shortest paths with exclusive-disjunction arc pairs conflicts

This page was built for publication: A reduction heuristic for the all-colors shortest path problem