On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP
Year of publication: |
2021
|
---|---|
Authors: | Zhong, Xianghui |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 49.2021, 4, p. 515-521
|
Subject: | 12 | 3-Opt algorithm | Approximation algorithm | Approximation ratio | Traveling salesman problem | Theorie | Theory | Algorithmus | Algorithm | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Mathematische Optimierung | Mathematical programming |
-
An O(log n/log log n)-approximation algorithm for the asymmetric traveling salesman problem
Asadpour, Arash, (2017)
-
Tool path optimisation method for large thin-wall part of spacecraft
Wang, Haichao, (2018)
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
- More ...
-
Slightly improved upper bound on the integrality ratio for the s−t Path TSP
Zhong, Xianghui, (2020)
-
The approximation ratio of the 2-Opt heuristic for the metric Traveling Salesman Problem
Hougardy, Stefan, (2020)
- More ...