An integer programming approach for the time-dependent traveling salesman problem with time windows
Year of publication: |
December 2017
|
---|---|
Authors: | Montero, Agustín ; Méndez-Díaz, Isabel ; Miranda-Bront, Juan José |
Published in: |
Computers & operations research : and their applications to problems of world concern ; an international journal. - Oxford [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 194012-0. - Vol. 88.2017, p. 280-289
|
Subject: | Time-dependent TSP | Time windows | Integer linear programming | Branch-and-Cut | Theorie | Theory | Tourenplanung | Vehicle routing problem | Rundreiseproblem | Travelling salesman problem | Ganzzahlige Optimierung | Integer programming | Mathematische Optimierung | Mathematical programming |
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
-
The circlet inequalities : a new, circulant-based, facet-defining inequality for the TSP
Gutekunst, Samuel C., (2023)
-
Identification of unidentified equality constraints for integer programming problems
Moeini, Asghar, (2017)
- More ...
-
An ILP-based local search procedure for the VRP with pickups and deliveries
Montero, Agustín, (2017)
-
Solving the Traveling Salesman Problem with release dates via branch and cut
Montero, Agustín, (2023)
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
- More ...