A branch-and-bound approach to the traveling salesman problem with a drone
Year of publication: |
2019
|
---|---|
Authors: | Poikonen, Stefan ; Golden, Bruce ; Wasil, Edward A. |
Published in: |
INFORMS journal on computing : JOC. - Catonsville, MD : INFORMS, ISSN 1091-9856, ZDB-ID 1316077-1. - Vol. 31.2019, 2, p. 335-346
|
Subject: | 970 transportation | vehicle routing | 490 networks-graphs | traveling salesman | 630 programming | integer | algorithms | branch and bound | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm |
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
Algorithms based on branch and bound for the flying sidekick traveling salesman problem
Dell'Amico, Mauro, (2021)
-
A branch and cut algorithm for the time-dependent profitable tour problem with resource constraints
Lera-Romero, Gonzalo, (2021)
- More ...
-
The paired mail carrier problem
Luo, Yuchen, (2023)
-
Golden, Bruce, (1994)
-
Computerized vehicle routing in the soft drink industry
Golden, Bruce, (1987)
- More ...