Facets and valid inequalities for the time-dependent travelling salesman problem
Year of publication: |
2014
|
---|---|
Authors: | Miranda-Bront, Juan José ; Méndez-Díaz, Isabel ; Zabala, Paula |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 236.2014, 3, p. 891-902
|
Publisher: |
Elsevier |
Subject: | Combinatorial optimization | Integer programming | Time-Dependent TSP | Branch and Cut |
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, Agustín, (2017)
-
Branch-and-cut algorithms for the p-arborescence star problem
Pereira, Armando Honorio, (2022)
- More ...
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
-
An ILP based heuristic for a generalization of the post-enrollment course timetabling problem
Méndez-Díaz, Isabel, (2016)
-
A cluster-first route-second approach for the swap body vehicle routing problem
Miranda-Bront, Juan José, (2017)
- More ...