Registro:
| Documento: |
Conferencia
|
| Título: | Infeasible path formulations for the time-dependent TSP with time windows |
| Autor: | Méndez-Díaz, I.; Miranda-Bront, J.J.; Toth, P.; Zabala, P. |
| Ciudad: | Frascati |
| Filiación: | Departamento de Computacíon, FCEyN, Universidad de Buenos Aires, Av. Cantilo s.n., Buenos Aires, Argentina
DEIS, University of Bologna, Bologna, Italy
|
| Palabras clave: | Branch and cut; Infeasible path; TDTSP; Time windows |
| Año: | 2011
|
| Página de inicio: | 198
|
| Página de fin: | 202
|
| Título revista: | 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011
|
| Título revista abreviado: | Cologne-Twente Workshop Graphs Comb. Optim., CTW - Proc. Conf.
|
| Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10031_v_n_p198_MendezDiaz |
Referencias:
- Albiach, J., Sanchis, J.M., Soler, D., An asymmetric tsp with time windows and with time-dependent travel times and costs: An exact solution through a graph transformation (2008) Eur. J. Oper. Res., 189 (3), pp. 789-802
- Dash, S., Günlük, O., Lodi, A., Tramontani, A., A time bucket formulation for the tsp with time windows (2010) Forthcoming in INFORMS J. Comput.
- Malandraki, C., Daskin, M.S., Time dependent vehicle routing problems: Formulations, properties and heuristic algorithms (1992) Transportation, Sci., 26 (3), pp. 185-200
- Stecco, G., Cordeau, J.-F., Moretti, E., A branch-and-cut algorithm for a production scheduling problem with sequence-dependent and time-dependent setup times (2008) Comput. Oper. Res., 35 (8), pp. 2635-2655A4 - Universita di Roma "Tor Vergata"
Citas:
---------- APA ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Toth, P. & Zabala, P.
(2011)
. Infeasible path formulations for the time-dependent TSP with time windows. 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 198-202.
Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10031_v_n_p198_MendezDiaz [ ]
---------- CHICAGO ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Toth, P., Zabala, P.
"Infeasible path formulations for the time-dependent TSP with time windows"
. 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011
(2011) : 198-202.
Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10031_v_n_p198_MendezDiaz [ ]
---------- MLA ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Toth, P., Zabala, P.
"Infeasible path formulations for the time-dependent TSP with time windows"
. 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 2011, pp. 198-202.
Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10031_v_n_p198_MendezDiaz [ ]
---------- VANCOUVER ----------
Méndez-Díaz, I., Miranda-Bront, J.J., Toth, P., Zabala, P. Infeasible path formulations for the time-dependent TSP with time windows. Cologne-Twente Workshop Graphs Comb. Optim., CTW - Proc. Conf. 2011:198-202.
Available from: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10031_v_n_p198_MendezDiaz [ ]
