Articles under review

  • [PDF] Daniel M. Ocampo-Giraldo, Ana M. Anaya-Arenas, and Claudio Contardo. A dynamic discretization discovery algorithm for the routing of multiple and highly perishable commodities: an application to the transportation of biomedical samples. Technical Report CIRRELT-2021-38, CIRRELT, 2021. Submitted
    [Bibtex] 
    @techreport{bstp2021,
title  =  {A dynamic discretization discovery algorithm for the routing of multiple and highly perishable commodities: an application to the transportation of biomedical samples},
author  =  {Daniel M. Ocampo-Giraldo and Ana M. Anaya-Arenas and Claudio Contardo},
year  =  {2021},
institution  =  {CIRRELT},
number  =  {CIRRELT-2021-38},
pdf  =  {https://www.cirrelt.ca/documentstravail/cirrelt-2021-38.pdf},
note  =  {Submitted}
}
  • [PDF] Claudio Contardo and Sandra U. Ngueveu. On the approximation of separable non-convex optimization programs to an arbitrary numerical precision. Technical Report, 2021. Submitted
    [Bibtex] 
    @techreport{cn2021,
title  =  {On the approximation of separable non-convex optimization programs to an arbitrary numerical precision},
author  =  {Claudio Contardo and Sandra U. Ngueveu},
year  =  {2021},
pdf  =  {https://hal.archives-ouvertes.fr/hal-03336022v1},
note  =  {Submitted}
}
  • [PDF] David Escobar-Vargas, Teodor G. Crainic, and Claudio Contardo. Synchronization in two-echelon distribution systems: models, algorithms, and sensitivity analyses. Technical Report CIRRELT-2021-24, CIRRELT, 2021.
    [Bibtex] 
    @techreport{escobar2021,
title  =  {Synchronization in two-echelon distribution systems: models, algorithms, and sensitivity analyses},
author  =  {David Escobar-Vargas and Teodor G. Crainic and Claudio Contardo},
institution  =  {CIRRELT},
number  =  {CIRRELT-2021-24},
pdf  =  {https://www.cirrelt.ca/documentstravail/cirrelt-2021-24.pdf},
year  =  {2021}
}
  • [PDF] Naveed Haghani, Jiaoyang Li, Sven Koenig, Gautam Kunapuli, Claudio Contardo, Amelia Regan, and Julian Yarkony. Multi-robot routing with time windows: a column generation approach. 2021.
    [Bibtex] 
    @misc{haghani2021multirobot,
title={Multi-Robot Routing with Time Windows: A Column Generation Approach},
author={Naveed Haghani and Jiaoyang Li and Sven Koenig and Gautam Kunapuli and Claudio Contardo and Amelia Regan and Julian Yarkony},
year={2021},
eprint={2103.08835},
archivePrefix={arXiv},
primaryClass={cs.RO},
pdf  =  {https://arxiv.org/abs/2103.08835}
}
  • Kim T. Ton, Daniel Aloise, and Claudio Contardo. On removing diverse data instances for training machine learning models. 2021. Submitted
    [Bibtex] 
    @misc{ton2021,
title  =  {On removing diverse data instances for training machine learning models},
author  =  {Kim T. Ton and Daniel Aloise and Claudio Contardo},
year  =  {2021},
note  =  {Submitted}
}

Peer reviewed publications

  • [DOI] Contardo, Claudio and Luciano Costa. “On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization.” International Transactions in Operational Research (2022).
    [Bibtex] 
    @Article{layout2022,
title = {On the optimal layout of a dining room in the era of {COVID-19} using mathematical optimization},
author = {Claudio Contardo and Luciano Costa},
journal  =  {International Transactions in Operational Research},
note  =  {Forthcoming},
keywords=  {published},
doi = {10.1111/itor.13139},
year = {2022}
}
  • Contardo, Claudio, Andrea Lodi, and Andrea Tramontani. “Cutting planes from the branch-and-bound tree: challenges and opportunities.” INFORMS Journal on Computing (2022).
    [Bibtex] 
    @Article{cuttingplanes2022ijoc,
title = {Cutting planes from the branch-and-bound tree: challenges and opportunities},
author = {Contardo, Claudio and Andrea Lodi and Andrea Tramontani},
journal = {INFORMS Journal on Computing},
note = {Forthcoming},
year = {2022},
keywords = {published}
}
  • [DOI] Rocha, Diego, Daniel Aloise, Dario J. Aloise, and Claudio Contardo. “Visual attractiveness in vehicle routing via bi-objective optimization.” Computers & Operations Research 137 (2022).
    [Bibtex] 
    @Article{drocha2020,
title = {Visual attractiveness in vehicle routing via bi-objective optimization},
author = {Rocha, Diego and Daniel Aloise and Dario J. Aloise and Claudio Contardo},
journal = {Computers \& Operations Research},
volume = {137},
year = {2022},
keywords=  {published},
doi  =  {10.1016/j.cor.2021.105507}
}
  • [DOI] Cherkesly, Marilène and Claudio Contardo. “The conditional p-dispersion problem.” Journal of Global Optimization 81 (2021): 23–83.
    [Bibtex] 
    @Article{cpdp2019,
title = {The conditional p-dispersion problem},
author = {Cherkesly, Maril\`ene and Claudio Contardo},
journal = {Journal of Global Optimization},
volume  =  {81},
pages  =  {23--83},
year = {2021},
doi  =  {10.1007/s10898-020-00962-4},
keywords = {published}
}
  • [DOI] Haghani, Naveed, Claudio Contardo, and Julian Yarkony. “Smooth and flexible dual optimal inequalities.” INFORMS Journal on Optimization (2021).
    [Bibtex] 
    @Article{haghani2021,
title = {Smooth and flexible dual optimal inequalities},
author = {Haghani, Naveed and Claudio Contardo and Julian Yarkony},
journal =  {INFORMS Journal on Optimization},
note  =  {Forthcoming},
keywords =  {published},
year = {2021},
doi  =  {10.1287/ijoo.2021.0057}
}
  • [DOI] Contardo, Claudio and Jorge A. Sefair. “A progressive approximation approach for the exact solution of sparse large-scale binary interdiction games.” INFORMS Journal on Computing (2021).
    [Bibtex] 
    @Article{interdiction2021,
title={A progressive approximation approach for the exact solution of sparse large-scale binary interdiction games},
author={Contardo, Claudio and Jorge A. Sefair},
journal={INFORMS Journal on Computing},
note={Forthcoming},
year={2021},
keywords = {published},
doi={10.1287/ijoc.2021.1085}
}
  • [DOI] Costa, Luciano, Claudio Contardo, Guy Desaulniers, and Julian Yarkony. “Stabilized column generation via the dynamic separation of aggregated rows.” INFORMS Journal on Computing (2021).
    [Bibtex] 
    @Article{costa2021ijoc,
title = {Stabilized column generation via the dynamic separation of aggregated rows},
author = {Costa, Luciano and Claudio Contardo and Guy Desaulniers and Julian Yarkony},
journal  =  {INFORMS Journal on Computing},
note = {Forthcoming},
doi = {10.1287/ijoc.2021.1094},
year = {2021},
keywords=  {published}
}
  • [DOI] Contardo, Claudio and Alain Hertz. “An exact algorithm for a class of geometric set-cover problems.” Discrete Applied Mathematics 300 (2021): 25–35.
    [Bibtex] 
    @Article{geomsc2020,
title = {An exact algorithm for a class of geometric set-cover problems},
author = {Contardo, Claudio and Alain Hertz},
journal = {Discrete Applied Mathematics},
volume  =  {300},
pages  =  {25--35},
year = {2021},
doi  =  {10.1016/j.dam.2021.05.005},
keywords  =  {published}
}
  • [DOI] Contardo, Claudio. “Decremental clustering for the solution of p-dispersion problems to proven optimality.” INFORMS Journal on Optimization 2 (2020): 134–144.
    [Bibtex] 
    @Article{contardo2019decremental,
title={Decremental clustering for the solution of p-dispersion problems to proven optimality},
author={Contardo, Claudio},
journal={INFORMS Journal on Optimization},
volume={2},
pages = {134--144},
year={2020},
doi = {10.1287/ijoo.2019.0027},
keywords={published}
}
  • [DOI] Costa, Luciano, Claudio Contardo, Guy Desaulniers, and Diego Pecin. “Selective arc-ng pricing for vehicle routing.” International Transactions in Operational Research (2020).
    [Bibtex] 
    @Article{costa2020itor,
title = {Selective arc-ng pricing for vehicle routing},
author = {Costa, Luciano and Claudio Contardo and Guy Desaulniers and Diego Pecin},
journal = {International Transactions in Operational Research},
note = {Forthcoming},
year = {2020},
keywords = {published},
doi  =  {10.1111/itor.12911}
}
  • [DOI] Desaulniers, Guy, Diego Pecin, and Claudio Contardo. “Selective pricing in branch-price-and-cut algorithms for vehicle routing.” EURO Journal on Transportation and Logistics 8 (2019): 147–168.
    [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] Contardo, Claudio, Manuel Iori, and Raphael Kramer. “A scalable exact algorithm for the vertex p-center problem.” Computers & Operations Research 103 (2019): 211–220.
    [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] Costa, Luciano, Claudio Contardo, and Guy Desaulniers. “Exact branch-price-and-cut algorithms for vehicle routing.” Transportation Science 53 (2019): 946–985.
    [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},
volume = {53},
pages = {946--985},
keywords = {published},
doi={https://doi.org/10.1287/trsc.2018.0878}
}
  • [DOI] Aloise, Daniel and Claudio Contardo. “A sampling-based exact algorithm for the solution of the minimax diameter clustering problem.” Journal of Global Optimization 71 (2018): 613–630.
    [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] Enderer, Furkan, Claudio Contardo, and Iván Contreras. “Integrating Dock-Door Assignment and Vehicle Routing in Cross-Docking.” Computers & Operations Research 88 (2017): 30–43.
    [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] Pecin, Diego, Claudio Contardo, Guy Desaulniers, and Eduardo Uchoa. “New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows.” INFORMS Journal on Computing 29 (2017): 489–502.
    [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] Contardo, Claudio, Guy Desaulniers, and François Lessard. “Reaching the elementary lower bound in the vehicle routing problem with time windows.” Networks 65 (2015): 88–99.
    [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] Martinelli, Rafael and Claudio Contardo. “Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure.” INFORMS Journal on Computing 27 (2015): 658–676.
    [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] Contardo, Claudio, Jean-François Cordeau, and Bernard Gendron. “An exact algorithm based on cut-and-column generation for the capacitated location-routing problem.” INFORMS Journal on Computing 26 (2014): 88–102.
    [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] Contardo, Claudio, Jean-François Cordeau, and Bernard Gendron. “A GRASP + ILP-based metaheuristic for the capacitated location-routing problem.” Journal of Heuristics 20 (2014): 1–38.
    [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] Contardo, Claudio and Rafael Martinelli. “A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints.” Discrete Optimization 12 (2014): 129–146.
    [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] Contardo, Claudio, Jean-François Cordeau, and Bernard Gendron. “A computational comparison of flow formulations for the capacitated location-routing problem.” Discrete Optimization 10 (2013): 263–295.
    [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] Contardo, Claudio, Vera C. Hemmelmayr, and Teodor Gabriel Crainic. “Lower and upper bounds for the two-echelon capacitated location-routing problem.” Computers & Operations Research 39 (2012): 3185–3199.
    [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] Cortés, Cristián E., Martín Matamala, and Claudio Contardo. “The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method.” European Journal of Operational Research 200 (2010): 711–724.
    [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},
}