Layers and matroids for the traveling salesman's paths
Frans Schalekamp, András Sebő, Vera Traub, Anke van Zuylen
| Year of publication: |
Janauary 2018
|
|---|---|
| Authors: | Schalekamp, Frans ; Sebő, András ; Traub, Vera ; Van Zuylen, Anke |
| Published in: |
Operations research letters. - Amsterdam [u.a.] : Elsevier, ISSN 0167-6377, ZDB-ID 720735-9. - Vol. 46.2018, 1, p. 60-63
|
| Subject: | Path traveling salesman problem (TSP) | Matroid partition | Approximation algorithm | Spanning tree | Christofides’ heuristic | Polyhedra | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Algorithmus | Algorithm | Graphentheorie | Graph theory |
| Type of publication: | Article |
|---|---|
| Type of publication (narrower categories): | Aufsatz in Zeitschrift ; Article in journal |
| Language: | English |
| Other identifiers: | 10.1016/j.orl.2017.11.002 [DOI] |
| Source: | ECONIS - Online Catalogue of the ZBW |
Persistent link: https://www.econbiz.de/10011807914