The approximation ratio of the 2-Opt heuristic for the metric Traveling Salesman Problem
Year of publication: |
2020
|
---|---|
Authors: | Hougardy, Stefan ; Zaiser, Fabian ; Zhong, Xianghui |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 48.2020, 4, p. 401-404
|
Subject: | 2-opt | Approximation algorithm | Metric TSP | Traveling Salesman Problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Algorithmus | Algorithm |
-
Capacitated vehicle routing with nonuniform speeds
Gørtz, Inge Li, (2016)
-
A generalized model and a heuristic algorithm for the large-scale covering tour problem
Murakami, Keisuke, (2018)
-
Exact and heuristic algorithms for the carrier-vehicle traveling salesman problem
Erdoğan, Güneş, (2021)
- More ...
-
On the approximation ratio of the 3-Opt algorithm for the (1,2)-TSP
Zhong, Xianghui, (2021)
-
Slightly improved upper bound on the integrality ratio for the s−t Path TSP
Zhong, Xianghui, (2020)
-
Extremal uniquely Hamiltonian graphs
Hougardy, Stefan, (1993)
- More ...