| Balancing a dynamic public bike-sharing system C Contardo, C Morency, LM Rousseau | 243 | 2012 |
| The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method CE Cortés, M Matamala, C Contardo European Journal of Operational Research 200 (3), 711-724, 2010 | 213 | 2010 |
| A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints C Contardo, R Martinelli Discrete Optimization 12, 129-146, 2014 | 144 | 2014 |
| Lower and Upper Bounds for the Two-Echelon Capacitated Location-Routing Problem C Contardo, V Hemmelmayr, TG Crainic Computers and Operations Research 39, 3185-3199, 2012 | 125 | 2012 |
| An exact algorithm based on cut-and-column generation for the capacitated location-routing problem C Contardo, JF Cordeau, B Gendron INFORMS Journal on Computing 26, 88-102, 2014 | 121* | 2014 |
| A GRASP+ ILP-based metaheuristic for the capacitated location-routing problem C Contardo, JF Cordeau, B Gendron Journal of Heuristics 20, 1-38, 2014 | 61 | 2014 |
| A computational comparison of flow formulations for the capacitated location-routing problem C Contardo, JF Cordeau, B Gendron Discrete Optimization 10 (4), 263-295, 2013 | 57 | 2013 |
| New enhancements for the exact solution of the vehicle routing problem with time windows D Pecin, C Contardo, G Desaulniers, E Uchoa INFORMS Journal on Computing 29, 489--502, 2017 | 50 | 2017 |
| Integrating cross-dock assignment and vehicle routing with cross-docking F Enderer, C Contardo, I Contreras Computers & Operations Research, 2017 | 29* | 2017 |
| Exact branch-price-and-cut algorithms for vehicle routing L Costa, C Contardo, G Desaulniers Transportation Science, 2019 | 20 | 2019 |
| Reaching the Elementary Lower Bound in the Vehicle Routing Problem with Time Windows C Contardo, G Desaulniers, F Lessard Networks 65, 88-99, 2015 | 18 | 2015 |
| A scalable exact algorithm for the vertex p-center problem C Contardo, M Iori, R Kramer Computers & Operations Research 103, 211--220, 2019 | 10 | 2019 |
| Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure R Martinelli, C Contardo INFORMS Journal on Computing 27, 658-676, 2015 | 6* | 2015 |
| A sampling-based exact algorithm for the solution of the minimax diameter clustering problem D Aloise, C Contardo Journal of Global Optimization, 2018 | 5 | 2018 |
| Selective pricing in branch-price-and-cut algorithms for vehicle routing G Desaulniers, D Pecin, C Contardo EURO Journal on Transportation and Logistics, 1-22, 2017 | 4 | 2017 |
| Models and algorithms for the capacitated location-routing problem C Contardo Université de Montréal, 2011 | 3 | 2011 |
| Decremental clustering for the solution of p-dispersion problems to proven optimality C Contardo INFORMS Journal on Optimization, 2019 | 2 | 2019 |
| Relaxed Dual Optimal Inequalities for Relaxed Columns: with Application to Vehicle Routing N Haghani, C Contardo, J Yarkony arXiv preprint arXiv:2004.05499, 2020 | 1 | 2020 |
| Smooth and flexible dual optimal inequalities N Haghani, C Contardo, J Yarkony arXiv preprint arXiv:2001.02267, 2020 | 1 | 2020 |
| A Progressive approximation approach for the exact solution of sparse large-scale binary interdiction games C Contardo, JA Sefair techreport G–2019–49, Cahiers du GERAD, 2019 | 1 | 2019 |
Jean-François CordeauHEC MontréalAdresse e-mail validée de hec.ca
