nov. 2020 The conditional \(p\)-dispersion problem Marilène Cherkesly et Claudio Contardo Journal of Global Optimization, 2020 référence BibTeX
avr. 2020 Decremental clustering for the solution of \(p\)-dispersion problems to proven optimality Claudio Contardo INFORMS Journal on Optimization, 2(2), 134–144, 2020 référence BibTeX
juil. 2019 Exact branch-price-and-cut algorithms for vehicle routing Luciano Costa, Claudio Contardo et Guy Desaulniers Transportation Science, 53(4), 946–985, 2019 référence BibTeX
juin 2019 Selective pricing in branch-price-and-cut algorithms for vehicle routing Guy Desaulniers, Diego Galindo Pecin et Claudio Contardo EURO Journal on Transportation and Logistics, 8(2), 147–168, 2019 référence BibTeX
mars 2019 A scalable exact algorithm for the vertex \(p\)-center problem Claudio Contardo, Manuel Iori et Raphael Kramer Computers & Operations Research, 103, 211–220, 2019 référence BibTeX
mars 2018 A sampling-based exact algorithm for the solution of the minimax diameter clustering problem Daniel Aloise et Claudio Contardo Journal of Global Optimization, 71, 613–630, 2018 référence BibTeX
déc. 2017 Integrating dock-door assignment and vehicle routing with cross-docking Furkan Enderer, Claudio Contardo et Ivan Contreras Computers & Operations Research, 88, 30–43, 2017 référence BibTeX
juin 2017 New enhancements for the exact solution of the vehicle routing problem with time windows Diego Galindo Pecin, Claudio Contardo, Guy Desaulniers et Eduardo Uchoa INFORMS Journal on Computing, 29(3), 489–502, 2017 référence BibTeX
nov. 2015 Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure Rafael Martinelli et Claudio Contardo INFORMS Journal on Computing, 27(4), 658–676, 2015 référence BibTeX
jan. 2015 Reaching the elementary lower bound in the vehicle routing problem with time windows Claudio Contardo, Guy Desaulniers et François Lessard Networks, 65(1), 88–99, 2015 référence BibTeX
mai 2014 A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints Claudio Contardo et Rafael Martinelli Discrete Optimization, 12, 129–146, 2014 référence BibTeX
fév. 2014 A GRASP + ILP-based metaheuristic for the capacitated location-routing problem Claudio Contardo, Jean-François Cordeau et Bernard Gendron Journal of Heuristics, 20(1), 1–38, 2014 référence BibTeX
jan. 2014 An exact method based on cut-and-column generation for the capacitated location-routing problem Claudio Contardo, Jean-François Cordeau et Bernard Gendron INFORMS Journal on Computing, 26(1), 88–102, 2014 référence BibTeX
nov. 2013 A computational comparison of flow formulations for the capacitated location-routing problem Claudio Contardo, Jean-François Cordeau et Bernard Gendron Discrete Optimization, 10(4), 263–295, 2013 référence BibTeX
déc. 2012 Lower and upper bounds for the two- echelon capacitated location-routing problem Claudio Contardo, Vera C. Hemmelmayr et Teodor Gabriel Crainic Computers & Operations Research, 39(12), 3185–3199, 2012 référence BibTeX
sept. 2016 A new global optimization algorithm for diameter minimization clustering Daniel Aloise et Claudio Contardo Global Optimization Workshop - GOW 2016, Braga, Portugal, 171–174, 2016 référence BibTeX