Facets and valid inequalities for the time-dependent travelling salesman problem
The Time-Dependent Travelling Salesman Problem (TDTSP) is a generalization of the traditional TSP where the travel cost between two cities depends on the moment of the day the arc is travelled. In this paper, we focus on the case where the travel time between two cities depends not only on the dista...
Guardado en:
Autores principales: | Miranda-Bront, J.J., Méndez-Díaz, I., Zabala, P. |
---|---|
Formato: | JOUR |
Materias: | |
Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_03772217_v236_n3_p891_MirandaBront |
Aporte de: |
Ejemplares similares
-
Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda Bront, Juan José, et al.
Publicado: (2014) -
Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda-Bront, J.J., et al. -
Facets and valid inequalities for the time-dependent travelling salesman problem
por: Miranda Bront, Juan José, et al.
Publicado: (2013) -
An integer programming approach for the time-dependent traveling salesman problem with time windows
por: Montero, A., et al. -
An integer programming approach for the time-dependent traveling salesman problem with time windows
Publicado: (2017)