Recherche
-
Branch-and-cut-and-price for the robust capacitated vehicle routing problem with knapsack uncertainty
(Operations Research. vol. 69, n° 3, pp. 739-754, 2021)Article de revue -
On the exact solution of vehicle routing problems with backhauls
(European Journal of Operational Research. vol. 287, n° 1, pp. 76-89, 2020)Article de revue -
On the exact solution of a large class of parallel machine scheduling problems
(Journal of Scheduling. vol. 23, pp. 411-429, 2020)Article de revue -
An Exact Approach for the Precedence Constrained Generalized Traveling Salesman Problem
(2022-11-20)Document de travail - Pré-publication -
Non-Robust Strong Knapsack Cuts for Capacitated Location-Routing and Related Problems
Communication dans un congrès -
New route formulations for the Split-Delivery Vehicle Routing Problems
Communication dans un congrès -
Tutorial: The power of non-robust cuts in branch-cut-and-price algorithms
Communication dans un congrès -
New exact and heuristic algorithms to solve the prize-collecting job sequencing problem with one common and multiple secondary resources
(European Journal of Operational Research, 2022)Article de revue