Recherche
-
The two-machine flowshop total completion time problem: branch-and-bound algorithms based on network-flow formulation
(European Journal of Operational Research, 2016)Article de revue -
Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
(Discrete Optimization. vol. 29, pp. 18-44, 2018-02-13)Article de revue -
Column generation based approaches for a tour scheduling problem with multi-skill heterogeneous workforce
(European Journal of Operational Research, 2016)Article de revue