C
Claudio Contardo
Researcher at Université du Québec à Montréal
Publications - 45
Citations - 1359
Claudio Contardo is an academic researcher from Université du Québec à Montréal. The author has contributed to research in topics: Vehicle routing problem & Column generation. The author has an hindex of 15, co-authored 43 publications receiving 1034 citations. Previous affiliations of Claudio Contardo include Université du Québec & Université de Montréal.
Papers
More filters
Journal ArticleDOI
The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method
TL;DR: A strict formulation of a generalization of the classical pickup and delivery problem is presented, and it is concluded that there exist some configurations in which a scheme allowing transfers results in better quality optimal solutions.
Journal ArticleDOI
A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints
TL;DR: The computational results show that the proposed algorithm is competitive against state-of-the-art methods for these two classes of vehicle routing problems, and is able to solve to optimality some previously open instances.
Journal ArticleDOI
Lower and upper bounds for the two-echelon capacitated location-routing problem
TL;DR: A branch-and-cut algorithm based on the solution of a new two-index vehicle-flow formulation, which is strengthened with several families of valid inequalities, is introduced to address the two-echelon capacitated location-routing problem (2E-CLRP).
Journal ArticleDOI
Exact Branch-Price-and-Cut Algorithms for Vehicle Routing
TL;DR: The leading exact algorithms for solving many classes of VRPs are branch-price-and-cut algorithms, which provide simple and scalable solutions to vehicle routing problems.
Journal ArticleDOI
An Exact Algorithm Based on Cut-and-Column Generation for the Capacitated Location-Routing Problem
TL;DR: An exact algorithm based on cut-and-column generation for the capacitated location-routing problem (CLRP) that can improve the bounds found in the literature, solve to optimality some previously open instances, and improve the upper bounds on some other instances.