Publications

Technical reports (under review)

  • [PDF] C. Contardo and J. A. Sefair, “A progressive approximation scheme for the exact solution of sparse large-scale binary interdiction games,” Cahiers du GERAD, G-2019-49, 2019.
    [Bibtex] 
    @techreport{interdiction2019,
title={A progressive approximation scheme for the exact solution of sparse large-scale binary interdiction games},
author={Contardo, Claudio and Jorge A. Sefair},
institution={Cahiers du GERAD},
number={G-2019-49},
year={2019},
pdf={https://www.gerad.ca/en/papers/G-2019-49}
}
  • M. Cherkesly and C. Contardo, “The conditional p-dispersion problem,” Cahiers du GERAD, G-2019-61, 2019.
    [Bibtex] 
    @techreport{cpdp2019,
title  =  {The conditional p-dispersion problem},
author  =  {Cherkesly, Maril\`ene and Claudio Contardo},
institution  =  {Cahiers du GERAD},
number  =  {G-2019-61},
year  =  {2019}
}

Peer reviewed publications

  • [PDF] C. Contardo, “Decremental clustering for the solution of p-dispersion problems to proven optimality,” INFORMS Journal on Optimization, 2019.
    [Bibtex] 
    @Article{contardo2019decremental,
title={Decremental clustering for the solution of p-dispersion problems to proven optimality},
author={Contardo, Claudio},
journal={INFORMS Journal on Optimization},
note={Forthcoming},
year={2019},
pdf = {https://www.gerad.ca/en/papers/G-2019-22},
keywords={published}
}
  • [DOI] C. Contardo, M. Iori, and R. Kramer, “A scalable exact algorithm for the vertex p-center problem,” Computers & Operations Research, vol. 103, p. 211–220, 2019.
    [Bibtex] 
    @Article{contardo-pcp,
author = {Claudio Contardo and Manuel Iori and Raphael Kramer},
title = {A scalable exact algorithm for the vertex p-center problem},
journal = {Computers \& Operations Research},
year = {2019},
volume = {103},
pages = {211--220},
keywords = {published},
doi={10.1016/j.cor.2018.11.006}
}
  • [DOI] G. Desaulniers, D. Pecin, and C. Contardo, “Selective pricing in branch-price-and-cut algorithms for vehicle routing,” EURO Journal on Transportation and Logistics, vol. 8, p. 147–168, 2019.
    [Bibtex] 
    @Article{Desaulniers2017,
author = {Guy Desaulniers and Diego Pecin and Claudio Contardo},
title = {Selective pricing in branch-price-and-cut algorithms for vehicle routing},
journal = {EURO Journal on Transportation and Logistics},
year = {2019},
volume = {8},
pages = {147--168},
doi = {10.1007/s13676-017-0112-9},
keywords = {published},
}
  • [DOI] L. Costa, C. Contardo, and G. Desaulniers, “Exact branch-price-and-cut algorithms for vehicle routing,” Transportation Science, 2019.
    [Bibtex] 
    @Article{costa2018,
author = {Luciano Costa and Claudio Contardo and Guy Desaulniers},
title = {Exact branch-price-and-cut algorithms for vehicle routing},
journal = {Transportation Science},
year = {2019},
note = {Forthcoming},
keywords = {published},
doi={https://doi.org/10.1287/trsc.2018.0878}
}
  • [DOI] D. Aloise and C. Contardo, “A sampling-based exact algorithm for the solution of the minimax diameter clustering problem,” Journal of Global Optimization, vol. 71, p. 613–630, 2018.
    [Bibtex] 
    @Article{AloiseContardoDMCP,
author = {Daniel Aloise and Claudio Contardo},
title = {A sampling-based exact algorithm for the solution of the minimax diameter clustering problem},
journal = {Journal of Global Optimization},
year = {2018},
volume = {71},
pages = {613--630},
doi = {10.1007/s10898-018-0634-1},
keywords = {published},
owner = {claudio},
timestamp = {2015.12.17},
}
  • [DOI] F. Enderer, C. Contardo, and I. Contreras, “Integrating Dock-Door Assignment and Vehicle Routing in Cross-Docking,” Computers & Operations Research, vol. 88, p. 30–43, 2017.
    [Bibtex] 
    @Article{furkan-cor-2015,
author = {Furkan Enderer and Claudio Contardo and Iván Contreras},
title = {Integrating Dock-Door Assignment and Vehicle Routing in Cross-Docking},
journal = {Computers \& Operations Research},
year = {2017},
volume = {88},
pages = {30--43},
doi = {10.1016/j.cor.2017.06.018},
keywords = {published},
owner = {claudio},
timestamp = {2016.02.02},
}
  • [DOI] D. Pecin, C. Contardo, G. Desaulniers, and E. Uchoa, “New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows,” INFORMS Journal on Computing, vol. 29, p. 489–502, 2017.
    [Bibtex] 
    @Article{pecin-vrptw,
author = {Diego Pecin and Claudio Contardo and Guy Desaulniers and Eduardo Uchoa},
title = {New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows},
journal = {INFORMS Journal on Computing},
year = {2017},
volume = {29},
pages = {489--502},
doi = {10.1287/ijoc.2016.0744},
keywords = {published},
owner = {claudio},
timestamp = {2016.03.04},
}
  • [DOI] R. Martinelli and C. Contardo, “Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure,” INFORMS Journal on Computing, vol. 27, p. 658–676, 2015.
    [Bibtex] 
    @Article{martinelli-contardo-qcvrp-ijoc,
author = {Rafael Martinelli and Claudio Contardo},
title = {Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure},
journal = {INFORMS Journal on Computing},
year = {2015},
volume = {27},
pages = {658--676},
doi = {10.1287/ijoc.2015.0649},
keywords = {published},
owner = {claudio},
timestamp = {2015.03.31},
}
  • [DOI] C. Contardo, G. Desaulniers, and F. Lessard, “Reaching the elementary lower bound in the vehicle routing problem with time windows,” Networks, vol. 65, p. 88–99, 2015.
    [Bibtex] 
    @Article{contardo-desaulniers-lessard-networks2015,
author = {Claudio Contardo and Guy Desaulniers and François Lessard},
title = {Reaching the elementary lower bound in the vehicle routing problem with time windows},
journal = {Networks},
year = {2015},
volume = {65},
pages = {88--99},
doi = {10.1002/net.21594},
keywords = {published},
timestamp = {2014.03.31},
}
  • [DOI] C. Contardo and R. Martinelli, “A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints,” Discrete Optimization, vol. 12, p. 129–146, 2014.
    [Bibtex] 
    @Article{contardo-martinelli-disopt2014,
author = {Claudio Contardo and Rafael Martinelli},
title = {A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints},
journal = {Discrete Optimization},
year = {2014},
volume = {12},
pages = {129--146},
doi = {10.1016/j.disopt.2014.03.001},
keywords = {published},
owner = {ccontard},
timestamp = {2012.10.16},
}
  • [DOI] C. Contardo, Jean-François Cordeau, and B. Gendron, “An exact algorithm based on cut-and-column generation for the capacitated location-routing problem,” INFORMS Journal on Computing, vol. 26, p. 88–102, 2014.
    [Bibtex] 
    @Article{contardo-cordeau-gendron-joc2014,
author = {Claudio Contardo and {Jean-François Cordeau} and Bernard Gendron},
title = {An exact algorithm based on cut-and-column generation for the capacitated location-routing problem},
journal = {INFORMS Journal on Computing},
year = {2014},
volume = {26},
pages = {88--102},
doi = {10.1287/ijoc.2013.0549},
keywords = {published},
owner = {ccontard},
timestamp = {2011.12.22},
}
  • [DOI] C. Contardo, J. Cordeau, and B. Gendron, “A GRASP + ILP-based metaheuristic for the capacitated location-routing problem,” Journal of Heuristics, vol. 20, p. 1–38, 2014.
    [Bibtex] 
    @Article{contardo-cordeau-gendron-joh2014,
author = {Claudio Contardo and Jean-François Cordeau and Bernard Gendron},
title = {A {GRASP + ILP}-based metaheuristic for the capacitated location-routing problem},
journal = {Journal of Heuristics},
year = {2014},
volume = {20},
pages = {1--38},
doi = {10.1007/s10732-013-9230-1},
keywords = {published},
owner = {ccontard},
timestamp = {2011.08.08},
}
  • [DOI] C. Contardo, J. Cordeau, and B. Gendron, “A computational comparison of flow formulations for the capacitated location-routing problem,” Discrete Optimization, vol. 10, p. 263–295, 2013.
    [Bibtex] 
    @Article{contardo-cordeau-gendron-disopt2013,
author = {Claudio Contardo and Jean-François Cordeau and Bernard Gendron},
title = {A computational comparison of flow formulations for the capacitated location-routing problem},
journal = {Discrete Optimization},
year = {2013},
volume = {10},
pages = {263--295},
doi = {10.1016/j.disopt.2013.07.005},
keywords = {published},
owner = {ccontard},
timestamp = {2011.12.22},
}
  • [DOI] C. Contardo, V. C. Hemmelmayr, and T. G. Crainic, “Lower and upper bounds for the two-echelon capacitated location-routing problem,” Computers & Operations Research, vol. 39, p. 3185–3199, 2012.
    [Bibtex] 
    @Article{contardo-hemmelmayr-crainic-cor2012,
author = {Claudio Contardo and Vera C. Hemmelmayr and Teodor Gabriel Crainic},
title = {Lower and upper bounds for the two-echelon capacitated location-routing problem},
journal = {Computers \& Operations Research},
year = {2012},
volume = {39},
pages = {3185--3199},
doi = {10.1016/j.cor.2012.04.003},
keywords = {published},
owner = {ccontard},
timestamp = {2014.03.31},
}
  • [DOI] C. E. Cortés, M. Matamala, and C. Contardo, “The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method,” European Journal of Operational Research, vol. 200, p. 711–724, 2010.
    [Bibtex] 
    @Article{cortes-matamala-contardo-ejor2010,
author = {Cristián E. Cortés and Martín Matamala and Claudio Contardo},
title = {The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method},
journal = {European Journal of Operational Research},
year = {2010},
volume = {200},
pages = {711--724},
doi = {10.1016/j.ejor.2009.01.022},
keywords = {published},
owner = {ccontard},
timestamp = {2014.03.31},
}