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 -
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 -
The Two-Echelon Stochastic Multi-period Capacitated Location-Routing Problem
(European Journal of Operational Research, 2022-07-16)Article de revue -
A branch-cut-and-price approach for the single-trip and multi-trip two-echelon vehicle routing problem with time windows
(Transportation Science. vol. 56, n° 6, pp. 1598-1617, 2022-03-16)Article de revue -
Bin Packing Problem with Time Lags
(INFORMS Journal on Computing. vol. 34, n° 4, pp. 2249-2270, 2022-03-16)Article de revue -
Solving Vehicle Routing Problems With Intermediate Stops Using VRPSolver Models
(Networks. vol. 81, n° 3, pp. 399-416, 2022-12-07)Article de revue -
Design of Robust Programmable Networks with Bandwidth-optimal Failure Recovery Scheme
(Computer Networks. vol. 192, n° 108043, 2021-06)Article de revue -
A POPMUSIC matheuristic for the capacitated vehicle routing problem
(Computers and Operations Research. vol. 136, n° 105475, 2021-12)Article de revue