Approximations for many-visits multiple traveling salesman problems
Year of publication: |
2023
|
---|---|
Authors: | Bérczi, Kristóf ; Mnich, Matthias ; Vincze, Roland |
Published in: |
Omega : the international journal of management science. - Oxford [u.a.] : Elsevier, ISSN 0305-0483, ZDB-ID 124502-8. - Vol. 116.2023, p. 1-13
|
Subject: | Aircraft sequencing | Many-agent scheduling | Traveling salesman | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Ethik | Ethics |
-
A 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
An approximation algorithm for a special case of the asymmetric travelling salesman problem
Barketau, Maksim, (2016)
-
Capacitated vehicle routing with nonuniform speeds
Gørtz, Inge Li, (2016)
- More ...
-
Supermodularity in unweighted graph optimization I : branchings and matchings
Bérczi, Kristóf, (2018)
-
Supermodularity in unweighted graph optimization II : matroidal term rank augmentation
Bérczi, Kristóf, (2018)
-
Supermodularity in unweighted graph optimization III : highly connected digraphs
Bérczi, Kristóf, (2018)
- More ...