On the Shortest Path Problems with Edge Constraints. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (ICTON, 2020)

A reinforcement learning iterated local search for makespan minimization in additive manufacturing machine scheduling problems. - Mirko Alicastro; Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Comput. Oper. Res., 2021)

A dynamic programming algorithm for solving the k-Color Shortest Path Problem. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Optim. Lett., 2021)

Optimizing and Reoptimizing: tackling static and dynamic combinatorial problems. - Serena Fugaro (2021)

Shortest path reoptimization vs resolution from scratch: a computational comparison. - Paola Festa; Serena Fugaro; Francesca Guerriero (Optim. Methods Softw., 2022)

The resource constrained clustered shortest path tree problem: Mathematical formulation and Branch&Price solution algorithm. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Networks, 2023)

Advanced network connectivity features and zonal requirements in Covering Location problems. - Serena Fugaro; Antonino Sgalambro (Comput. Oper. Res., 2023)

Hybridizing a matheuristic with ALNS for the optimal collection and delivery of medical specimens. - Daniele Ferone; Paola Festa; Serena Fugaro; Tommaso Pastore (Int. Trans. Oper. Res., 2025)