On the Approximation Ratio of the 3-Opt Algorithm for the (1,2)-TSP
From MaRDI portal
Publication:6361739
DOI10.1016/j.orl.2021.05.012zbMath1525.90381arXiv2103.00504MaRDI QIDQ6361739
Publication date: 28 February 2021
Abstract computational complexity for mathematical programming problems (90C60) Combinatorial optimization (90C27)
This page was built for publication: On the Approximation Ratio of the 3-Opt Algorithm for the (1,2)-TSP