Modèles et Algorithmes pour les Problèmes de Livraison du Dernier Kilomètre avec Plusieurs Options d'Expédition. (Models and Algorithms for Last Mile Delivery Problems with Multiple Shipping Options). - Yuan Yuan 013 (2019)

A branch-and-cut algorithm for the generalized traveling salesman problem with time windows. - Yuan Yuan 013; Diego Cattaruzza; Maxime Ogier; Frédéric Semet (Eur. J. Oper. Res., 2020)

A note on the lifted Miller-Tucker-Zemlin subtour elimination constraints for routing problems with time windows. - Yuan Yuan 013; Diego Cattaruzza; Maxime Ogier; Frédéric Semet (Oper. Res. Lett., 2020)

Mixed integer programming formulations for the generalized traveling salesman problem with time windows. - Yuan Yuan 013; Diego Cattaruzza; Maxime Ogier; Cyriaque Rousselot; Frédéric Semet (4OR, 2021)

Models and algorithms for last mile delivery problems with multiple shipping options. - Yuan Yuan 013 (4OR, 2021)