Conferencia

Factorovich, P.; Méndez-Díaz, I.; Zabala, P. "Pickup and delivery problem with incompatibility constraints" (2011) 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011:150-153
Estamos trabajando para incorporar este artículo al repositorio

Registro:

Documento: Conferencia
Título:Pickup and delivery problem with incompatibility constraints
Autor:Factorovich, P.; Méndez-Díaz, I.; Zabala, P.
Ciudad:Frascati
Filiación:Departamento de Computacíon, FCEyN, Universidad de Buenos Aires, Argentina
Palabras clave:Incompatibilities; Pickup and delivery problem; Routing
Año:2011
Página de inicio:150
Página de fin:153
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_NIS10122_v_n_p150_Factorovich

Referencias:

  • Berbeglia, G., Cordeau, J.-F., Gribkovskaia, I., Laporte, G., (2007) Static Pickup and Delivery Problems: A Classification Scheme and Survey, 15, pp. 1-31. , TOP
  • Dumitrescu, I., Ropke, S., Cordeau, J.-F., Laporte, G., The traveling salesman problem with pickup and delivery: Polyhedral results and a branchand- cut algorithm (2010) Math. Program, 121, pp. 269-305. , Series A
  • Feng, X., (2006) Formal Sequential Lagrangian Algorithm for Large Scale Resource Scheduling Optimization, , US Patent 2006/0089863 A1
  • Gouveia, L., Pires, J.M., The asymmetric travelling salesman problem and a reformulation of the miller-tucker-zemlin constraints (1999) European J. Oper. Res., 112, pp. 134-146
  • Sarin, S.C., Sherali, H.D., Bhootra, A., New tighter polynomial length formulations for the asymmetric travelling salesman problem with and without precedence constraints (2005) Oper. Res. Lett., 33, pp. 62-70A4 - Universita di Roma "Tor Vergata"

Citas:

---------- APA ----------
Factorovich, P., Méndez-Díaz, I. & Zabala, P. (2011) . Pickup and delivery problem with incompatibility constraints. 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 150-153.
Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10122_v_n_p150_Factorovich [ ]
---------- CHICAGO ----------
Factorovich, P., Méndez-Díaz, I., Zabala, P. "Pickup and delivery problem with incompatibility constraints" . 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011 (2011) : 150-153.
Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10122_v_n_p150_Factorovich [ ]
---------- MLA ----------
Factorovich, P., Méndez-Díaz, I., Zabala, P. "Pickup and delivery problem with incompatibility constraints" . 10th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, CTW 2011, 2011, pp. 150-153.
Recuperado de https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10122_v_n_p150_Factorovich [ ]
---------- VANCOUVER ----------
Factorovich, P., Méndez-Díaz, I., Zabala, P. Pickup and delivery problem with incompatibility constraints. Cologne-Twente Workshop Graphs Comb. Optim., CTW - Proc. Conf. 2011:150-153.
Available from: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_NIS10122_v_n_p150_Factorovich [ ]