Minimum Weighted Feedback Vertex Set on Diamonds. - Francesco Carrabs; Raffaele Cerulli; Monica Gentili; Gennaro Parlato (Electron. Notes Discret. Math., 2004)

A linear time algorithm for the minimum Weighted Feedback Vertex Set on diamonds. - Francesco Carrabs; Raffaele Cerulli; Monica Gentili; Gennaro Parlato (Inf. Process. Lett., 2005)

An Additive Branch-and-Bound Algorithm for the Pickup and Delivery Traveling Salesman Problem with LIFO or FIFO Loading. - Francesco Carrabs; Raffaele Cerulli; Jean-François Cordeau (INFOR Inf. Syst. Oper. Res., 2007)

Variable Neighborhood Search for the Pickup and Delivery Traveling Salesman Problem with LIFO Loading. - Francesco Carrabs; Jean-François Cordeau; Gilbert Laporte (INFORMS J. Comput., 2007)

The labeled maximum matching problem. - Francesco Carrabs; Raffaele Cerulli; Monica Gentili (Comput. Oper. Res., 2009)

The maximum labeled clique problem. - Paolo Dell'Olmo; Raffaele Cerulli; Francesco Carrabs (CTW, 2011)

A Tabu Search Heuristic Based on k-Diamonds for the Weighted Feedback Vertex Set Problem. - Francesco Carrabs; Raffaele Cerulli; Monica Gentili; Gennaro Parlato (INOC, 2011)

Lower and upper bounds for the spanning tree with minimum branch vertices. - Francesco Carrabs; Raffaele Cerulli; Manlio Gaudioso; Monica Gentili (Comput. Optim. Appl., 2013)

A branch-and-bound algorithm for the double travelling salesman problem with two stacks. - Francesco Carrabs; Raffaele Cerulli; Maria Grazia Speranza (Networks, 2013)

A Tabu Search Approach for the Circle Packing Problem. - Francesco Carrabs; Carmine Cerrone; Raffaele Cerulli (NBiS, 2014)

A memetic algorithm for the weighted feedback vertex set problem. - Francesco Carrabs; Carmine Cerrone; Raffaele Cerulli (Networks, 2014)

Maximizing lifetime in wireless sensor networks with multiple sensor families. - Francesco Carrabs; Raffaele Cerulli; Ciriaco D'Ambrosio; Monica Gentili; Andrea Raiconi (Comput. Oper. Res., 2015)

A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints. - Francesco Carrabs; Raffaele Cerulli; Ciriaco D'Ambrosio; Andrea Raiconi (J. Netw. Comput. Appl., 2015)

Improved Upper and Lower Bounds for the Close Enough Traveling Salesman Problem. - Francesco Carrabs; Carmine Cerrone; Raffaele Cerulli; Ciriaco D'Ambrosio (GPC, 2017)

Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints. - Francesco Carrabs; Raffaele Cerulli; Ciriaco D'Ambrosio; Andrea Raiconi (GPC, 2017)

A novel discretization scheme for the close enough traveling salesman problem. - Francesco Carrabs; Carmine Cerrone; Raffaele Cerulli; Manlio Gaudioso (Comput. Oper. Res., 2017)

An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. - Francesco Carrabs; Raffaele Cerulli; Ciriaco D'Ambrosio; Andrea Raiconi (Optim. Lett., 2017)

Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints. - Francesco Carrabs; Raffaele Cerulli; Ciriaco D'Ambrosio; Andrea Raiconi (RAIRO Oper. Res., 2017)

An exact approach for the grocery delivery problem in urban areas. - Francesco Carrabs; Raffaele Cerulli; Anna Sciomachen (Soft Comput., 2017)

A two-level metaheuristic for the all colors shortest path problem. - Francesco Carrabs; Raffaele Cerulli; Rosa Pentangelo; Andrea Raiconi (Comput. Optim. Appl., 2018)

The Set Orienteering Problem. - Claudia Archetti; Francesco Carrabs; Raffaele Cerulli (Eur. J. Oper. Res., 2018)

Preface: Theoretical and algorithmic contributions to network optimization problems. - Francesco Carrabs; Raffaele Cerulli; Monica Gentili (Networks, 2018)

On the complexity of rainbow spanning forest problem. - Francesco Carrabs; Carmine Cerrone; Raffaele Cerulli; Selene Silvestri (Optim. Lett., 2018)

The rainbow spanning forest problem. - Francesco Carrabs; Carmine Cerrone; Raffaele Cerulli; Selene Silvestri (Soft Comput., 2018)

Exact approaches for the orderly colored longest path problem: Performance comparison. - Francesco Carrabs; Raffaele Cerulli; Giovanni Felici; Gaurav Singh 002 (Comput. Oper. Res., 2019)

A multiethnic genetic approach for the minimum conflict weighted spanning tree problem. - Francesco Carrabs; Carmine Cerrone; Rosa Pentangelo (Networks, 2019)

An Adaptive Heuristic Approach to Compute Upper and Lower Bounds for the Close-Enough Traveling Salesman Problem. - Francesco Carrabs; Carmine Cerrone; Raffaele Cerulli; Bruce L. Golden (INFORMS J. Comput., 2020)

Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. - Francesco Carrabs; Raffaele Cerulli; Rosa Pentangelo; Andrea Raiconi (Ann. Oper. Res., 2021)

A biased random-key genetic algorithm for the set orienteering problem. - Francesco Carrabs (Eur. J. Oper. Res., 2021)

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)

A Lagrangian approach for the minimum spanning tree problem with conflicting edge pairs. - Francesco Carrabs; Manlio Gaudioso (Networks, 2021)

Optimization of sensor battery charging to maximize lifetime in a wireless sensors network. - Francesco Carrabs; Ciriaco D'Ambrosio; Andrea Raiconi (Optim. Lett., 2021)

A reduction heuristic for the all-colors shortest path problem. - Francesco Carrabs; Raffaele Cerulli; Andrea Raiconi (RAIRO Oper. Res., 2021)

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

Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP. - Francesco Carrabs; Raffaele Cerulli; Renata Mansini; Lorenzo Moreschini; Domenico Serra (Comput. Oper. Res., 2024)

Kernel Search approach to solve the Minimum Spanning Tree Problem with conflicting edge pairs. - Francesco Carrabs; Martina Cerulli; Domenico Serra (CoRR, 2024)

A two-point heuristic to calculate the stepsize in subgradient method with application to a network design problem. - Francesco Carrabs; Manlio Gaudioso; Giovanna Miglionico (EURO J. Comput. Optim., 2024)

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)

Upper Bound Computation for the Multiple Close-Enough Traveling Salesman Problem. - Francesco Carrabs; Raffaele Cerulli; Ciriaco D'Ambrosio; Gabriele Murano (ICORES, 2025)

Hybridizing Carousel Greedy and Kernel Search: A new approach for the maximum flow problem with conflict constraints. - Francesco Carrabs; Raffaele Cerulli; Renata Mansini; Domenico Serra; Carmine Sorgente (Eur. J. Oper. Res., 2025)