Claudio Contardo
Orcid: 0000-0001-7595-3904
According to our database1,
Claudio Contardo
authored at least 30 papers
between 2010 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
Discret. Appl. Math., 2024
Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming.
Proceedings of the Combinatorial Optimization - 8th International Symposium, 2024
2023
INFORMS J. Comput., 2023
2022
On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization.
Int. Trans. Oper. Res., 2022
INFORMS J. Comput., 2022
A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games.
INFORMS J. Comput., 2022
Comput. Oper. Res., 2022
2021
Discret. Appl. Math., 2021
2020
Decremental Clustering for the Solution of <i>p</i>-Dispersion Problems to Proven Optimality.
INFORMS J. Optim., January, 2020
CoRR, 2020
Relaxed Dual Optimal Inequalities for Relaxed Columns: with Application to Vehicle Routing.
CoRR, 2020
2019
EURO J. Transp. Logist., 2019
Comput. Oper. Res., 2019
2018
A sampling-based exact algorithm for the solution of the minimax diameter clustering problem.
J. Glob. Optim., 2018
2017
New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows.
INFORMS J. Comput., 2017
Comput. Oper. Res., 2017
2015
Reaching the elementary lower bound in the vehicle routing problem with time windows.
Networks, 2015
Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure.
INFORMS J. Comput., 2015
2014
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem.
INFORMS J. Comput., 2014
J. Heuristics, 2014
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints.
Discret. Optim., 2014
2013
A computational comparison of flow formulations for the capacitated location-routing problem.
Discret. Optim., 2013
2012
Comput. Oper. Res., 2012
2010
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method.
Eur. J. Oper. Res., 2010