A genetic approach for the maximum network lifetime problem with additional operating time slot constraints. - Ciriaco D'Ambrosio; Antonio Iossa; Federica Laureana; Francesco Palmieri 002 (Soft Comput., 2020)

The Generalized Minimum Branch Vertices Problem: Properties and Polyhedral Analysis. - Francesco Carrabs; Raffaele Cerulli; Ciriaco D'Ambrosio; Federica Laureana (J. Optim. Theory Appl., 2021)

The constrained forward shortest path tour problem: Mathematical modeling and GRASP approximate solutions. - Francesco Carrabs; Ciriaco D'Ambrosio; Daniele Ferone; Paola Festa; Federica Laureana (Networks, 2021)

The Knapsack Problem with forfeit sets. - Ciriaco D'Ambrosio; Federica Laureana; Andrea Raiconi; Gaetano Vitale (Comput. Oper. Res., 2023)

A genetic approach for the 2-edge-connected minimum branch vertices problem. - Francesco Carrabs; Raffaele Cerulli; Federica Laureana; Domenico Serra; Carmine Sorgente (Networks, 2023)

Corrigendum to "A New Formulation and a Branch-and-Cut Algorithm for the Set Orienteering Problem" [European Journal of Operational Research, Volume 314, Issue 2, 16 April 2024, Pages 446-465]. - Claudia Archetti; Francesco Carrabs; Raffaele Cerulli; Federica Laureana (Eur. J. Oper. Res., 2024)

A new formulation and a branch-and-cut algorithm for the set orienteering problem. - Claudia Archetti; Francesco Carrabs; Raffaele Cerulli; Federica Laureana (Eur. J. Oper. Res., 2024)