Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood

DOI10.1007/978-3-030-34960-8_40zbMath1456.90136OpenAlexW3002525477MaRDI QIDQ2216018

Giuseppe Lancia, Marcello Dalpasso

Publication date: 15 December 2020

Full work available at URL: https://doi.org/10.1007/978-3-030-34960-8_40

zbMATH Keywords

local searchtraveling salesman problem\(K\)-opt neighborhood

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

This page was built for publication: Algorithmic strategies for a fast exploration of the TSP 4-OPT neighborhood