4 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2021★ 4 cited
The Approximation Ratio of the -Opt Heuristic for the Euclidean Traveling Salesman Problem
Ulrich A. Brodowsky, Stefan Hougardy, Xianghui Zhong
The -Opt heuristic is a simple improvement heuristic for the Traveling Salesman Problem. It starts with an arbitrary tour and then repeatedly replaces edges of the tour by $…
cs.DS2020★ 3 cited
The Approximation Ratio of the 2-Opt Heuristic for the Euclidean Traveling Salesman Problem
Ulrich A. Brodowsky, Stefan Hougardy
The 2-Opt heuristic is a simple improvement heuristic for the Traveling Salesman Problem. It starts with an arbitrary tour and then repeatedly replaces two edges of the tour by two…