Facets and valid inequalities for the time-dependent travelling salesman problem

Mostrar todas las versiones(2)

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...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Miranda-Bront, J.J., Méndez-Díaz, I., Zabala, P.
Formato: INPR
Lenguaje:English
Materias:
Branch and Cut
Combinatorial optimization
Integer programming
Time-Dependent TSP
Acceso en línea:http://hdl.handle.net/20.500.12110/paper_03772217_v_n_p_MirandaBront
Aporte de:
Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

Ejemplares similares

Ejemplares similares