The approximation ratio of the greedy algorithm for the metric traveling salesman problem
Year of publication: |
2015
|
---|---|
Authors: | Brecklinghaus, Judith ; Hougardy, Stefan |
Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 43.2015, 3, p. 259-261
|
Subject: | Traveling salesman problem | Greedy algorithm | Clarke-Wright savings heuristic | Approximation algorithm | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Algorithmus | Algorithm | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics |
-
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 ...
-
Extremal uniquely Hamiltonian graphs
Hougardy, Stefan, (1993)
-
Even and odd pairs in linegraphs of bipartite graphs
Hougardy, Stefan, (1993)
-
The approximation ratio of the 2-Opt heuristic for the metric Traveling Salesman Problem
Hougardy, Stefan, (2020)
- More ...