Claudio Contardo

Claudio Contardo

Professeur
Photo de Claudio Contardo
Téléphone : (514) 987-3000 poste 5311
Local : DS-3849
Langues : Français, Anglais, Espagnol, Portugais
Liens d'intérêt
Informations générales

Cheminement académique

(2016) Professeur aggrégé, Université du Québec à Montréal
(2012) Professeur adjoint, Université du Québec à Montréal
(2011) Ph.D. en informatique, Université de Montréal
(2005) B.Sc. en mathématiques de l'ingénieur, Université du Chili

Unités de recherche

  • Centre interuniversitaire de recherche sur les réseaux d'entreprise, la logistique et le transport (CIRRELT)
  • Groupe d'études et de recherche en analyse des décisions (GERAD)
Enseignement

Directions de thèses et mémoires

Rapports d'activités et projets d'intervention
  • Helé Taka, Pascaline (2019) Méthode de classification supervisée pour l'organisation des sessions d'une conférence scientifique : cas du JOPT. (Rapport d'activités et projet d'intervention). Université du Québec à Montréal.

Publications

Articles scientifiques
  • Costa, L., Contardo, C. et Desaulniers, G. Exact branch-price-and-cut algorithms for vehicle routing. Transportation Science.
    Notes: À paraître
  • Aloise, D. et Contardo, C. (2018). A sampling-based exact algorithm for the solution of the minimax diameter clustering problem. Journal of Global Optimization, 71(3), 613–630. http://dx.doi.org/10.1007/s10898-018-0634-1.
  • Contardo, C., Iori, M. et Kramer, R. (2018). A scalable exact algorithm for the vertex p-center problem. Computers & Operations Research, Prépublication. http://dx.doi.org/10.1016/j.cor.2018.11.006.
  • Enderer, F., Contardo, C. et Contreras, I. (2017). Integrating dock-door assignment and vehicle routing with cross-docking. Computers & Operations Research, 88, 30–43. http://dx.doi.org/10.1016/j.cor.2017.06.018.
  • Pecin, D., Contardo, C., Desaulniers, G. et Uchoa, E. (2017). New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows. INFORMS Journal on Computing, 29(3), 489–502. http://dx.doi.org/10.1287/ijoc.2016.0744.
  • Desaulniers, G., Pecin, D. et Contardo, C. (2017). Selective pricing in branch-price-and-cut algorithms for vehicle routing. EURO Journal on Transportation and Logistics, 1–22. http://dx.doi.org/10.1007/s13676-017-0112-9.
  • Martinelli, R. et Contardo, C. (2015). Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure. INFORMS Journal on Computing, 27(4), 658–676. http://dx.doi.org/10.1287/ijoc.2015.0649.
  • Contardo, C., Desaulniers, G. et Lessard, F. (2015). Reaching the elementary lower bound in the vehicle routing problem with time windows. Networks, 65(1), 88–99. http://dx.doi.org/10.1002/net.21594.
  • Contardo, C., Cordeau, J.-F. et Gendron, B. (2014). A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. Journal of Heuristics, 20(1), 1–38. http://dx.doi.org/10.1007/s10732-013-9230-1.
  • Contardo, C. et Martinelli, R. (2014). A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optimization, 12(1), 129–146. http://dx.doi.org/10.1016/j.disopt.2014.03.001.
  • Contardo, C., Cordeau, J.-F. et Gendron, B. (2014). An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS Journal on Computing, 26(1), 88–102. http://dx.doi.org/10.1287/ijoc.2013.0549.
  • Contardo, C., Cordeau, J.-F. et Gendron, B. (2013). A computational comparison of flow formulations for the capacitated location-routing problem. Discrete Optimization, 10(4), 263–295. http://dx.doi.org/10.1016/j.disopt.2013.07.005.
  • Contardo, C., Hemmelmayr, V. et Crainic, T.G. (2012). Lower and upper bounds for the two-echelon capacitated location-routing problem. Computers & Operations Research, 39(12), 3185–3199. http://dx.doi.org/10.1016/j.cor.2012.04.003.
  • Cortés, C.E., Matamala, M. et Contardo, C. (2010). The pickup and delivery problem with transfers : formulation and a branch-and-cut solution method. European Journal of Operational Research, 200(3), 711–724. http://dx.doi.org/10.1016/j.ejor.2009.01.022.