A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Year of publication: |
2015
|
---|---|
Authors: | Xu, Zhou ; Rodrigues, Brian |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 27.2015, 4, p. 636-645
|
Subject: | approximation algorithm | multiple depots | traveling salesman | matroid | Theorie | Theory | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Branch-and-Bound | Branch and Bound |
-
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Lera-Romero, Gonzalo, (2021)
-
A branch-and-bound approach to the traveling salesman problem with a drone
Poikonen, Stefan, (2019)
-
Xu, Zhou, (2017)
- More ...
-
An analysis of the extended Christofides heuristic for the k-depot TSP
Xu, Zhou, (2011)
-
Xu, Zhou, (2017)
-
A strongly polynomial FPTAS for the symmetric quadratic knapsack problem
Xu, Zhou, (2012)
- More ...