Solving the Traveling Salesman Problem with release dates via branch and cut
Year of publication: |
2023
|
---|---|
Authors: | Montero, Agustín ; Méndez-Díaz, Isabel ; Miranda-Bront, Juan José |
Subject: | Branch and cut | Integer Linear Programming | Release dates | Traveling Salesman Problem | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Mathematische Optimierung | Mathematical programming | Theorie | Theory | 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 3/2-approximation algorithm for the multiple TSP with a fixed number of depots
Xu, Zhou, (2015)
-
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem
Minh Anh Nguyen, (2023)
- More ...
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, Agustín, (2017)
-
An ILP-based local search procedure for the VRP with pickups and deliveries
Montero, Agustín, (2017)
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
- More ...