Mean-variance approach to the management of cyclic deliveries. - Raffaele Cerulli; Manlio Gaudioso (Comput. Oper. Res., 1988)

A class of manpower scheduling problems. - Raffaele Cerulli; Manlio Gaudioso; R. Mautone (ZOR Methods Model. Oper. Res., 1992)

The Auction Technique for the Sensor Based Navigation Planning of an Autonomous Mobile Robot. - Raffaele Cerulli; Paola Festa; Giancarlo Raiconi; G. Visciano (J. Intell. Robotic Syst., 1998)

Shortest Path Auction Algorithm Without Contractions Using Virtual Source Concept. - Raffaele Cerulli; Paola Festa; Giancarlo Raiconi (Comput. Optim. Appl., 2003)

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)

Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. - Raffaele Cerulli; Paolo Dell'Olmo; Monica Gentili; Andrea Raiconi (Electron. Notes Discret. Math., 2006)

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)

Efficient preflow push algorithms. - Raffaele Cerulli; Monica Gentili; Antonio Iossa (Comput. Oper. Res., 2008)

Bounded-degree spanning tree problems: models and new algorithms. - Raffaele Cerulli; Monica Gentili; Antonio Iossa (Comput. Optim. Appl., 2009)

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)

Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges. - Raffaele Cerulli; R. De Donato; Andrea Raiconi (Eur. J. Oper. Res., 2012)

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

Comparison of heuristics for the colourful travelling salesman problem. - John Silberholz; Andrea Raiconi; Raffaele Cerulli; Monica Gentili; Bruce L. Golden; S. Chen (Int. J. Metaheuristics, 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)

Locating sensors to observe network arc flows: Exact and heuristic approaches. - Lucio Bianco; Carmine Cerrone; Raffaele Cerulli; Monica Gentili (Comput. Oper. Res., 2014)

Relations, models and a memetic approach for three degree-dependent spanning tree problems. - Carmine Cerrone; Raffaele Cerulli; Andrea Raiconi (Eur. J. Oper. Res., 2014)

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

Editorial. - Raffaele Cerulli; Monica Gentili (Networks, 2014)

Maximizing lifetime and handling reliability in wireless sensor networks. - Raffaele Cerulli; Monica Gentili; Andrea Raiconi (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)

Vehicle-ID sensor location for route flow recognition: Models and algorithms. - Carmine Cerrone; Raffaele Cerulli; Monica Gentili (Eur. J. 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)

The Rainbow Cycle Cover Problem. - Selene Silvestri; Gilbert Laporte; Raffaele Cerulli (Networks, 2016)

Models, algorithms and applications for location problems. - Giuseppe Bruno; Raffaele Cerulli; Monica Gentili (Optim. Lett., 2016)

OMEGA one multi ethnic genetic approach. - Carmine Cerrone; Raffaele Cerulli; Manlio Gaudioso (Optim. Lett., 2016)

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)

Source Reconstruction of Atmospheric Releases with Limited Meteorological Observations Using Genetic Algorithms. - Alessio Petrozziello; Guido Cervone; Pasquale Franzese 001; Sue Ellen Haupt; Raffaele Cerulli (Appl. Artif. Intell., 2017)

Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations. - Andrea Raiconi; Julia Pahl; Monica Gentili; Stefan Voß 001; Raffaele Cerulli (Asia Pac. J. Oper. Res., 2017)

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

Carousel greedy: A generalized greedy algorithm with applications in optimization. - Carmine Cerrone; Raffaele Cerulli; Bruce L. Golden (Comput. Oper. Res., 2017)

A branch-and-cut algorithm for the minimum branch vertices spanning tree problem. - Selene Silvestri; Gilbert Laporte; Raffaele Cerulli (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)

Preface: Special issue on network optimization in transportation, logistics, and industry. - Raffaele Cerulli; Antonio Sforza; Daniele Vigo (Networks, 2019)

The Knapsack Problem with Forfeits. - Raffaele Cerulli; Ciriaco D'Ambrosio; Andrea Raiconi; Gaetano Vitale (ISCO, 2020)

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)

Contrasting the Spread of Misinformation in Online Social Networks. - Marco Amoruso; Daniele Anello; Vincenzo Auletta; Raffaele Cerulli; Diodato Ferraioli; Andrea Raiconi (J. Artif. Intell. Res., 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)

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

Grocery distribution plans in urban networks with street crossing penalties. - Carmine Cerrone; Raffaele Cerulli; Anna Sciomachen (Networks, 2021)

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

An iterative multiparametric approach for determining the location of AVI sensors for robust route flow estimation. - Fernando Álvarez-Bazo; Raffaele Cerulli; Santos Sánchez-Cambronero; Monica Gentili; Ana Rivas (Comput. Oper. Res., 2022)

Maximum Network Lifetime Problem with Time Slots and coverage constraints: heuristic approaches. - Raffaele Cerulli; Ciriaco D'Ambrosio; Antonio Iossa; Francesco Palmieri 002 (J. Supercomput., 2022)

Shortest paths with exclusive-disjunction arc pairs conflicts. - Raffaele Cerulli; Francesca Guerriero; Edoardo Scalzo; Carmine Sorgente (Comput. Oper. Res., 2023)

Quantifying Outcome Functions of Linear Programs: An Approach Based on Interval-Valued Right-Hand Sides. - Mohsen Mohammadi; Monica Gentili; Milan Hladík; Raffaele Cerulli (J. Optim. Theory Appl., 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)

A Service Oriented Architecture for Clinical Decision Support Systems Based on Artificial Intelligence. - Raffaele Cerulli; Mario Lepore; Raffaele Maccioni; Elvira Plenzich; Roberto Tufano (DSA ISC (2), 2024)

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)

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)

A biased random-key genetic algorithm for the knapsack problem with forfeit sets. - Raffaele Cerulli; Ciriaco D'Ambrosio; Andrea Raiconi (Soft Comput., 2024)

Improving patient's medical history classification using a feature construction approach based on situation awareness and granular computing. - Mario Lepore; Elvira Plenzich; Roberto Tufano; Raffaele Cerulli; Raffaele Maccioni (Neural Comput. Appl., 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)