Technical reports (under review)
-
Luciano Costa, Claudio Contardo, Guy Desaulniers, and Julian Yarkony. Stabilized column generation via the dynamic separation of aggregated rows. Technical Report G-2020-36, Cahiers du GERAD, 2020.
[Bibtex]@techreport{costa2020ijoc, title = {Stabilized column generation via the dynamic separation of aggregated rows}, author = {Costa, Luciano and Claudio Contardo and Guy Desaulniers and Julian Yarkony}, institution = {Cahiers du GERAD}, number = {G-2020-36}, pdf = {https://www.gerad.ca/en/papers/G-2020-36}, year = {2020} }
-
Diego Rocha, Daniel Aloise, Dario J. Aloise, and Claudio Contardo. Visual attractiveness in vehicle routing via bi-objective optimization. Technical Report G-2020-65, Cahiers du GERAD, 2020.
[Bibtex]@techreport{drocha2020, title = {Visual attractiveness in vehicle routing via bi-objective optimization}, author = {Diego Rocha and Daniel Aloise and Dario J. Aloise and Claudio Contardo}, institution = {Cahiers du GERAD}, number = {G-2020-65}, pdf = {https://www.gerad.ca/en/papers/G-2020-65}, year = {2020} }
-
Claudio Contardo and Alain Hertz. An exact algorithm for a class of geometric set-cover problems. Technical Report G-2020-17, Cahiers du GERAD, 2020.
[Bibtex]@techreport{geomsc2020, title = {An exact algorithm for a class of geometric set-cover problems}, author = {Contardo, Claudio and Alain Hertz}, institution = {Cahiers du GERAD}, number = {G-2020-17}, pdf = {https://www.gerad.ca/en/papers/G-2020-17}, year = {2020} }
-
Naveed Haghani, Claudio Contardo, and Julian Yarkony. Smooth and flexible dual optimal inequalities. Technical Report G-2019-94, Cahiers du GERAD, 2019.
[Bibtex]@techreport{haghani2019, title = {Smooth and flexible dual optimal inequalities}, author = {Haghani, Naveed and Claudio Contardo and Julian Yarkony}, institution = {Cahiers du GERAD}, number = {G-2019-94}, pdf = {https://arxiv.org/pdf/2001.02267}, year = {2019} }
-
Claudio Contardo and Jorge A. Sefair. A progressive approximation scheme for the exact solution of sparse large-scale binary interdiction games. Technical Report G-2019-49, Cahiers du GERAD, 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} }
Peer reviewed publications
- 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} }
-
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} }
-
Cherkesly, Marilène and Claudio Contardo. “The conditional p-dispersion problem.” Journal of Global Optimization (2020).
[Bibtex]@Article{cpdp2019, title = {The conditional p-dispersion problem}, author = {Cherkesly, Maril\`ene and Claudio Contardo}, journal = {Journal of Global Optimization}, note = {Forthcoming}, year = {2020}, doi = {10.1007/s10898-020-00962-4}, keywords = {published} }
-
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}, }
-
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} }
-
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} }
-
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}, }
-
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}, }
-
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}, }
-
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}, }
-
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}, }
-
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}, }
-
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}, }
-
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}, }
-
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}, }
-
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}, }
-
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}, }