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 : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 236.2014, 3 (1.8.), p. 891-902
|
Subject: | Combinatorial optimization | Integer programming | Time-Dependent TSP | Branch and Cut | Theorie | Theory | Rundreiseproblem | Travelling salesman problem | Tourenplanung | Vehicle routing problem | Scheduling-Verfahren | Scheduling problem | Ganzzahlige Optimierung |
-
An integer programming approach for the time-dependent traveling salesman problem with time windows
Montero, Agustín, (2017)
-
An efficient branch-and-cut algorithm for the parallel drone scheduling traveling salesman problem
Minh Anh Nguyen, (2023)
-
Improved integer linear programming formulations for the job sequencing and tool switching problem
Catanzaro, Daniele, (2015)
- More ...
-
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)
-
Facets and valid inequalities for the time-dependent travelling salesman problem
Miranda-Bront, Juan José, (2014)
- More ...