Dr Claudio Contardo
Pronouns: He/Him
- Associate Professor, Mechanical, Industrial and Aerospace Engineering
Are you the profile owner?
Sign in to editResearch areas: Operations Research, Logistics Management, Vehicle Routing, Location Analysis, Integer and Combinatorial Optimization. Artificial Intelligence
Contact information
Website:
ORCID:
Biography
Short Bio
Dr. Contardo is an Associate Professor of Industrial Engineering at Concordia University, since the Fall of 2022. He has more than 15 years of experience in Mathematical Optimization and its applications in Logistics Management, and Artificial Intelligence. He has published nearly 30 scientific articles at top-tier journals such as the INFORMS Journal on Computing, and Transportation Science.Teaching activities
INDU 6111
Theory of Operations Research
INDU 6361
Discrete Optimization
INDU 323
Operations Research I
INDU 6141
Logistics Network Models
Publications
Articles in international journals
| Cherkesly M, Contardo C and Gruson M (2024), "Ranking decomposition for the discrete ordered median problem", INFORMS Journal on Computing. |
BibTeX:
@article{opmedian,
author = {Maril�ne Cherkesly and Claudio Contardo and Matthieu Gruson},
title = {Ranking decomposition for the discrete ordered median problem},
journal = {INFORMS Journal on Computing},
year = {2024},
note = {Forthcoming},
doi = {10.1287/ijoc.2023.0059}
}
|
| Lamothe* F, Contardo C and Gruson M (2024), "Tilted inequalities and facets of the set covering polytope: a theoretical analysis", Discrete Applied Mathematics. Vol. 3001, pp. 1-21. |
BibTeX:
@article{Lamothe*2023,
author = {Lamothe*, Fran�ois and Contardo, Claudio and Gruson, Matthieu},
title = {Tilted inequalities and facets of the set covering polytope: a theoretical analysis},
journal = {Discrete Applied Mathematics},
year = {2024},
volume = {3001},
pages = {1--21},
doi = {10.1016/j.dam.2024.06.004}
}
|
| Rastgar-Amini* F, Aloise D, Contardo C and Desaulniers G (2024), "Data mining-driven shift enumeration for accelerating the solution of large-scale personnel scheduling problems", ACM Transactions on Evolutionary Learning and Optimization. , pp. 1-21.
[BibTeX] |
BibTeX:
@article{RastgarAmini*2023,
author = {Rastgar-Amini*, F and Aloise, D and Contardo, C and Desaulniers, G},
title = {Data mining-driven shift enumeration for accelerating the solution of large-scale personnel scheduling problems},
journal = {ACM Transactions on Evolutionary Learning and Optimization},
year = {2024},
pages = {1--21},
note = {Submitted to ACM Transations on Evolutionary and Learning Optimization (1^st round)}
}
|
| Contardo C, Lodi A and Tramontani A (2023), "Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities", INFORMS Journal on Computing. Vol. 35(1), pp. 2-4. INFORMS. |
BibTeX:
@article{Contardo2023,
author = {Contardo, Claudio and Lodi, Andrea and Tramontani, Andrea},
title = {Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities},
journal = {INFORMS Journal on Computing},
publisher = {INFORMS},
year = {2023},
volume = {35},
number = {1},
pages = {2--4},
doi = {10.1287/ijoc.2022.1248}
}
|
| Contardo C and Costa* L (2022), "On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization", International Transactions in Operational Research. Wiley Online Library. |
BibTeX:
@article{contardo2022optimal,
author = {Contardo, Claudio and Costa*, Luciano},
title = {On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization},
journal = {International Transactions in Operational Research},
publisher = {Wiley Online Library},
year = {2022},
doi = {10.1111/itor.13139}
}
|
| Contardo C and Sefair JA (2022), "A progressive approximation approach for the exact solution of sparse large-scale binary interdiction games", INFORMS Journal on Computing. Vol. 34(2), pp. 890-908. INFORMS. |
BibTeX:
@article{contardo2022progressive,
author = {Contardo, Claudio and Sefair, Jorge A},
title = {A progressive approximation approach for the exact solution of sparse large-scale binary interdiction games},
journal = {INFORMS Journal on Computing},
publisher = {INFORMS},
year = {2022},
volume = {34},
number = {2},
pages = {890--908},
doi = {10.1287/ijoc.2021.1085}
}
|
| Costa* L, Contardo C, Desaulniers G and Yarkony J (2022), "Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows", INFORMS Journal on Computing. Vol. 34(2), pp. 1141-1156. INFORMS. |
BibTeX:
@article{costa2022stabilized,
author = {Costa*, Luciano and Contardo, Claudio and Desaulniers, Guy and Yarkony, Julian},
title = {Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows},
journal = {INFORMS Journal on Computing},
publisher = {INFORMS},
year = {2022},
volume = {34},
number = {2},
pages = {1141--1156},
doi = {10.1287/ijoc.2021.1094}
}
|
| Haghani* N, Contardo C and Yarkony J (2022), "Smooth and flexible dual optimal inequalities", INFORMS Journal on Optimization. Vol. 4(1), pp. 29-44. INFORMS. |
BibTeX:
@article{haghani2022smooth,
author = {Haghani*, Naveed and Contardo, Claudio and Yarkony, Julian},
title = {Smooth and flexible dual optimal inequalities},
journal = {INFORMS Journal on Optimization},
publisher = {INFORMS},
year = {2022},
volume = {4},
number = {1},
pages = {29--44},
doi = {10.1287/ijoo.2021.0057}
}
|
| Rocha* D, Aloise D, Aloise DJ and Contardo C (2022), "Visual attractiveness in vehicle routing via bi-objective optimization", Computers & Operations Research. Vol. 137, pp. 105507. Elsevier. |
BibTeX:
@article{rocha2022visual,
author = {Rocha*, Diego and Aloise, Daniel and Aloise, Dario J and Contardo, Claudio},
title = {Visual attractiveness in vehicle routing via bi-objective optimization},
journal = {Computers & Operations Research},
publisher = {Elsevier},
year = {2022},
volume = {137},
pages = {105507},
doi = {10.1016/j.cor.2021.105507}
}
|
| Cherkesly M and Contardo C (2021), "The conditional p-dispersion problem", Journal of Global Optimization. Vol. 81, pp. 23-83. |
BibTeX:
@article{contardo-condpdp,
author = {Maril�ne Cherkesly and Claudio Contardo},
title = {The conditional p-dispersion problem},
journal = {Journal of Global Optimization},
year = {2021},
volume = {81},
pages = {23--83},
doi = {10.1007/s10898-020-00962-4}
}
|
| Contardo C and Hertz A (2021), "An exact algorithm for a class of geometric set-cover problems", Discrete Applied Mathematics. Vol. 300, pp. 25-35. Elsevier. |
BibTeX:
@article{contardo2021exact,
author = {Contardo, Claudio and Hertz, Alain},
title = {An exact algorithm for a class of geometric set-cover problems},
journal = {Discrete Applied Mathematics},
publisher = {Elsevier},
year = {2021},
volume = {300},
pages = {25--35},
doi = {10.1016/j.dam.2021.05.005}
}
|
| Contardo C (2020), "Decremental clustering for the solution of p-dispersion problems to proven optimality", INFORMS Journal on Optimization. Vol. 2, pp. 134-144. |
BibTeX:
@article{contardo-pdp,
author = {Claudio Contardo},
title = {Decremental clustering for the solution of p-dispersion problems to proven optimality},
journal = {INFORMS Journal on Optimization},
year = {2020},
volume = {2},
pages = {134--144},
doi = {10.1287/ijoo.2019.0027}
}
|
| Costa* L, Contardo C, Desaulniers G and Pecin D (2020), "Selective arc-ng pricing for vehicle routing", International Transactions in Operational Research. Vol. 28, pp. 2633-2690. |
BibTeX:
@article{selectiveArcNg,
author = {Luciano Costa* and Claudio Contardo and Guy Desaulniers and Diego Pecin},
title = {Selective arc-ng pricing for vehicle routing},
journal = {International Transactions in Operational Research},
year = {2020},
volume = {28},
pages = {2633--2690},
doi = {10.1111/itor.12911}
}
|
| Contardo C, Iori M and Kramer* R (2019), "A scalable exact algorithm for the vertex p-center problem", Computers & Operations Research. Vol. 103, pp. 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},
doi = {10.1016/j.cor.2018.11.006}
}
|
| Costa* L, Contardo C and Desaulniers G (2019), "Exact branch-price-and-cut algorithms for vehicle routing", Transportation Science. Vol. 53, pp. 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},
doi = {10.1287/trsc.2018.0878}
}
|
| Desaulniers G, Pecin* D and Contardo C (2019), "Selective pricing in branch-price-and-cut algorithms for vehicle routing", EURO Journal on Transportation and Logistics. Vol. 8, pp. 147-168. |
BibTeX:
@article{Desaulniers2019,
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}
}
|
| Aloise D and Contardo C (2018), "A sampling-based exact algorithm for the solution of the minimax diameter clustering problem", Journal of Global Optimization. Vol. 71, pp. 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}
}
|
| Enderer* F, Contardo C and Contreras I (2017), "Integrating Dock-Door Assignment and Vehicle Routing in Cross-Docking", Computers & Operations Research. Vol. 88, pp. 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}
}
|
| Pecin* D, Contardo C, Desaulniers G and Uchoa E (2017), "New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows", INFORMS Journal on Computing. Vol. 29, pp. 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}
}
|
| Contardo C, Desaulniers G and Lessard F (2015), "Reaching the elementary lower bound in the vehicle routing problem with time windows", Networks. Vol. 65, pp. 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}
}
|
| Martinelli* R and Contardo C (2015), "Exact and heuristic algorithms for capacitated vehicle routing problems with quadratic costs structure", INFORMS Journal on Computing. Vol. 27, pp. 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}
}
|
| Contardo C, Cordeau Jean-Fran�ois and Gendron B (2014), "A GRASP ILP-based metaheuristic for the capacitated location-routing problem", Journal of Heuristics. Vol. 20, pp. 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}
}
|
| Contardo C, Cordeau Jean-Fran�ois and Gendron B (2014), "An exact algorithm based on cut-and-column generation for the capacitated location-routing problem", INFORMS Journal on Computing. Vol. 26, pp. 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}
}
|
| Contardo C and Martinelli* R (2014), "A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints", Discrete Optimization. Vol. 12, pp. 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}
}
|
| Contardo C, Cordeau Jean-Fran�ois and Gendron B (2013), "A computational comparison of flow formulations for the capacitated location-routing problem", Discrete Optimization. Vol. 10, pp. 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}
}
|
| Contardo C, Hemmelmayr VC and Crainic TG (2012), "Lower and upper bounds for the two-echelon capacitated location-routing problem", Computers & Operations Research. Vol. 39, pp. 3185-3199. |
BibTeX:
@article{contardo-hemmelmayr-crainic-cor2012,
author = {Claudio Contardo and Vera C. Hemmelmayr and Teodor G. 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}
}
|
| Cort�s CE, Matamala M and Contardo C (2010), "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method", European Journal of Operational Research. Vol. 200, pp. 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}
}
|
Are you the profile owner?
Sign in to edit
Took 37 milliseconds