Analysis and branch-and-cut algorithm for the time-dependent travelling salesman problem
Year of publication: |
2014
|
---|---|
Authors: | Cordeau, Jean-François ; Ghiani, Gianpaolo ; Guerriero, Emanuela |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 48.2014, 1, p. 46-58
|
Subject: | travelling salesman problem | time dependence | lower and upper bounds | branch and cut | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Theorie | Theory | Algorithmus | Algorithm |
-
An enhanced lower bound for the Time-Dependent Travelling Salesman Problem
Adamo, Tommaso, (2020)
-
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem
Minh Anh Nguyen, (2023)
-
Review of solution approaches for the symmetric traveling salesman problem
Saharidis, Georgios K. D., (2014)
- More ...
-
A learn-and-construct framework for general mixed-integer programming problems
Adamo, Tommaso, (2018)
-
Adamo, Tommaso, (2019)
-
Automatic instantiation of a Variable Neighborhood Descent from a Mixed Integer Programming model
Adamo, Tommaso, (2017)
- More ...