The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method. - Cristián E. Cortés; Martín Matamala; Claudio Contardo (Eur. J. Oper. Res., 2010)

Lower and upper bounds for the two-echelon capacitated location-routing problem. - Claudio Contardo; Vera C. Hemmelmayr; Teodor Gabriel Crainic (Comput. Oper. Res., 2012)

A computational comparison of flow formulations for the capacitated location-routing problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (Discret. Optim., 2013)

A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. - Claudio Contardo; Rafael Martinelli (Discret. Optim., 2014)

A GRASP + ILP-based metaheuristic for the capacitated location-routing problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (J. Heuristics, 2014)

An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem. - Claudio Contardo; Jean-François Cordeau; Bernard Gendron (INFORMS J. Comput., 2014)

Exact and Heuristic Algorithms for Capacitated Vehicle Routing Problems with Quadratic Costs Structure. - Rafael Martinelli; Claudio Contardo (INFORMS J. Comput., 2015)

Reaching the elementary lower bound in the vehicle routing problem with time windows. - Claudio Contardo; Guy Desaulniers; François Lessard (Networks, 2015)

Integrating dock-door assignment and vehicle routing with cross-docking. - Furkan Enderer; Claudio Contardo; Iván A. Contreras (Comput. Oper. Res., 2017)

New Enhancements for the Exact Solution of the Vehicle Routing Problem with Time Windows. - Diego Pecin; Claudio Contardo; Guy Desaulniers; Eduardo Uchoa (INFORMS J. Comput., 2017)

A sampling-based exact algorithm for the solution of the minimax diameter clustering problem. - Daniel Aloise; Claudio Contardo (J. Glob. Optim., 2018)

A scalable exact algorithm for the vertex p-center problem. - Claudio Contardo; Manuel Iori; Raphael Kramer (Comput. Oper. Res., 2019)

Selective pricing in branch-price-and-cut algorithms for vehicle routing. - Guy Desaulniers; Diego Pecin; Claudio Contardo (EURO J. Transp. Logist., 2019)

Exact Branch-Price-and-Cut Algorithms for Vehicle Routing. - Luciano Costa; Claudio Contardo; Guy Desaulniers (Transp. Sci., 2019)

Relaxed Dual Optimal Inequalities for Relaxed Columns: with Application to Vehicle Routing. - Naveed Haghani; Claudio Contardo; Julian Yarkony (CoRR, 2020)

Integer Programming for Multi-Robot Planning: A Column Generation Approach. - Naveed Haghani; Jiaoyang Li 001; Sven Koenig; Gautam Kunapuli; Claudio Contardo; Julian Yarkony (CoRR, 2020)

Decremental Clustering for the Solution of p-Dispersion Problems to Proven Optimality. - Claudio Contardo (INFORMS J. Optim., 2020)

Multi-Robot Routing with Time Windows: A Column Generation Approach. - Naveed Haghani; Jiaoyang Li 001; Sven Koenig; Gautam Kunapuli; Claudio Contardo; Amelia Regan; Julian Yarkony (CoRR, 2021)

Efficient labeling algorithms for adjacent quadratic shortest paths. - João Vilela; Bruno Fanzeres; Rafael Martinelli; Claudio Contardo (CoRR, 2021)

An exact algorithm for a class of geometric set-cover problems. - Claudio Contardo; Alain Hertz (Discret. Appl. Math., 2021)

Selective arc-ng pricing for vehicle routing. - Luciano Costa; Claudio Contardo; Guy Desaulniers; Diego Pecin (Int. Trans. Oper. Res., 2021)

The conditional p-dispersion problem. - Marilène Cherkesly; Claudio Contardo (J. Glob. Optim., 2021)

Visual attractiveness in vehicle routing via bi-objective optimization. - Diego Rocha Lima; Daniel Aloise; Dario J. Aloise; Claudio Contardo (Comput. Oper. Res., 2022)

A Progressive Approximation Approach for the Exact Solution of Sparse Large-Scale Binary Interdiction Games. - Claudio Contardo; Jorge A. Sefair (INFORMS J. Comput., 2022)

Stabilized Column Generation Via the Dynamic Separation of Aggregated Rows. - Luciano Costa; Claudio Contardo; Guy Desaulniers; Julian Yarkony (INFORMS J. Comput., 2022)

On the optimal layout of a dining room in the era of COVID-19 using mathematical optimization. - Claudio Contardo; Luciano Costa (Int. Trans. Oper. Res., 2022)

Smooth and Flexible Dual Optimal Inequalities. - Naveed Haghani; Claudio Contardo; Julian Yarkony (INFORMS J. Optim., 2022)

Cutting Planes from the Branch-and-Bound Tree: Challenges and Opportunities. - Claudio Contardo; Andrea Lodi 001; Andrea Tramontani (INFORMS J. Comput., 2023)

Optimal Counterfactual Explanations for k-Nearest Neighbors Using Mathematical Optimization and Constraint Programming. - Claudio Contardo; Ricardo Fukasawa; Louis-Martin Rousseau; Thibaut Vidal (ISCO, 2024)

Tilted inequalities and facets of the set covering polytope: A theoretical analysis. - François Lamothe; Claudio Contardo; Matthieu Gruson (Discret. Appl. Math., 2024)

Ranking Decomposition for the Discrete Ordered Median Problem. - Marilène Cherkesly; Claudio Contardo; Matthieu Gruson (INFORMS J. Comput., 2025)