Journal Articles

1. R. Cerulli, R. De Donato, A.Raiconi, Exact and Heuristic Methods to Maximize Network Lifetime in Wireless Sensor Networks with Adjustable Sensing Ranges, European Journal of Operational Research, Volume 220, Issue 1, pp. 58-66, 2012.

2. M. Gentili, A.Raiconi, α-Coverage to Extend Network Lifetime on Wireless Sensor Networks, Optimization Letters, Volume 7, Issue 1, pp.157-172, 2013.

3. J.Silberholz, A.Raiconi, R.Cerulli, M.Gentili, B.Golden, S.Chen, Comparison of Heuristics for the Colorful Traveling Salesman Problem, International Journal of Metaheuristics, Volume 2, Issue 2, pp.141-173, 2013.

4. C. Cerrone, R. Cerulli, A. Raiconi, Relations, Models and a Memetic Approach for Three Degree-Dependent Spanning Tree Problems, European Journal of Operational Research, Volume 232, Issue 3, pp.442-453, 2014.

5. R. Cerulli, M.Gentili, A. Raiconi, Maximizing lifetime and handling reliability in wireless sensor networks. Networks, Volume 64, Issue 4, pp.321-338, 2014.

6. F. Carrabs, R. Cerulli, C. D’Ambrosio, M. Gentili, A. Raiconi, Maximizing Lifetime in Wireless Sensor Networks with Multiple Sensor Families. Computers & Operations Research, Volume 60, pp. 121-137, 2015.

7. F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, A Hybrid Exact Approach for Maximizing Lifetime in Sensor Networks with Complete and Partial Coverage Constraints. Journal of Network and Computer Applications, Volume 58, pp. 12-22, 2015.

8. F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, An Exact Algorithm to Extend Lifetime through Roles Allocation in Sensor Networks with Connectivity Constraints. Optimization Letters, Volume 11, Issue 7, pp. 1341-1356, 2017.

9. A. Raiconi, J. Pahl, M. Gentili, S. Voß, R. Cerulli, Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations. Asia-Pacific Journal of Operational Research, Volume 4, Issue 5, Article number 1750019, 2017.

10. F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints. RAIRO - Operations Research, Volume 51, Issue 3, pp. 607-625, 2017.

11. F. Carrabs, R. Cerulli, R. Pentangelo, A. Raiconi, A two-level metaheuristic for the All Colors Shortest Path Problem, Computational Optimization and Applications Volume 71, Issue 2, pp. 525-551, 2018.

12. C. Cerrone, C. D'Ambrosio, A. Raiconi, Heuristics for the Strong Generalized Minimum Label Spanning Tree Problem. Networks, Volume 74, Issue 2, pp. 148-160, 2019.

13. M. Amoruso, D. Anello, V. Auletta, R. Cerulli, D. Ferraioli, A. Raiconi, Contrasting the Spread of Misinformation in Online Social Networks, Journal of Artificial Intelligence Research, Volume 69, pp. 847-879, 2020.

14. F. Carrabs, R. Cerulli, A. Raiconi, A Reduction Heuristic For The All-Colors Shortest Path Problem, RAIRO - Operations Research, Volume 55, pp. S2071-S2082, 2021.

15. F. Carrabs, R. Cerulli, R. Pentangelo, A. Raiconi, Minimum spanning tree with conflicting edge pairs: a Branch-and-Cut approach, Annals of Operations Research, Volume 298, pp. 65-78, 2021.

16. F. Carrabs, C. D'Ambrosio, A. Raiconi, Optimization of sensor battery charging to maximize lifetime in a wireless sensors network, Optimization Letters, Volume 15, pp. 1587-1600, 2021.

17. G. Capobianco, C. D’Ambrosio, L. Pavone, A. Raiconi, G. Vitale, F. Sebastiano, A hybrid metaheuristic for the Knapsack Problem with Forfeits, Soft Computing, Volume 26, Issue 2, pp. 749-762, 2022.

18. C. D'Ambrosio, F. Laureana, A. Raiconi, G. Vitale, The knapsack problem with forfeit sets, Computers & Operations Research,  Volume 151, 106093, 2023.

19. A. Vinceti, L. Trastulla, U. Perron, A. Raiconi, F. Iorio, A heuristic algorithm solving the mutual-exclusivity-sorting problem, Bioinformatics, Volume 39, Issue 1, btad016,  2023.

20. R. Cerulli, C. D'Ambrosio, A. Raiconi, A Biased Random-Key Genetic Algorithm for the Knapsack Problem with Forfeit Sets, Soft Computing, Volume 28, pp. 12021-12041, 2024.

21. D. Granata, A. Raiconi, Bi-Objective Knapsack Problem with Conflits, Annals of Operations Research, DOI: 10.1007/s10479-025-06792-5, 2025.

Book Chapters

1. D. Granata, R. Cerulli, M. G. Scutellà, A. Raiconi, Maximum Flow Problems And an NP-Complete Variant on Edge Labeled Graphs, in Handbook of Combinatorial Optimization (2nd Edition), Springer New York, pp.1913-1948, 2013.

Refereed Conference Papers

1. R. Cerulli, P. Dell’Olmo, M. Gentili, A. Raiconi, Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem, Electronic Notes in Discrete Mathematics, Volume 25, Issue 1, pp. 131-138, 2006.

2. M. Caserta, A. Fink, A. Raiconi, S. Schwarze, S. Voß, Mathematical formulations and metaheuristics comparison for the push-tree problem, Operations Research and Cyber-Infrastructure, pp. 253-278, 2009.

3. A. Raiconi, M. Gentili, Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks, Lecture Notes in Computer Science 6701, pp. 607-619, 2011.

4. R. Cerulli, M.Gentili, A. Fink, A. Raiconi, The k-Labeled Spanning Forest Problem, Procedia - Social and Behavioral Sciences, Volume 108, pp.153-163, 2014.

5. F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks. IFAC-PapersOnLine, Volume 49, Issue 12, pp. 973-978, 2016.

6. F. Carrabs, R. Cerulli, C. D’Ambrosio, A. Raiconi, Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints. Lecture Notes in Computer Science 10232, pp. 285-297, 2017.

7. F. Carrabs, C. Cerrone, C. D'Ambrosio, A. Raiconi, Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints. Springer Proceedings in Mathematics and Statistics, Volume 217, pp. 151-159, 2017.

8. F. Carrabs, R. Cerulli, C. D'Ambrosio, A. Raiconi, Maximizing Lifetime for a Zone Monitoring Problem Through Reduction to Target Coverage. AIRO Springer Series, Volume 1, pp. 111-119, 2018.

9. R. Cerulli, C. D'Ambrosio, A. Raiconi G. Vitale, The Knapsack Problem with Forfeits. Lecture Notes in Computer Science 12176, pp. 263-272, 2020.

10. M. Cerulli, C. D'Ambrosio, A. Raiconi, Time-Aware Influence Propagation on Networks: a Survey. To appear on Emerging Technologies in Computational Sciences for Industry, Sustainability and Innovation, Math to Product, Lecture Notes in Computational Science and Engineering Vol. 146, 2025.

Editorial Activity

• Associate Editor for Soft Computing  (from April 2019)

Former assignments:

• Associate editor for Advances in Computational Intelligence  (October 2020 -  December 2024)

• Guest Editor for Lecture Notes in Computer Science 11184 (Computational Logistics - 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1-3, 2018, Proceedings), volume editors: R. Cerulli, A. Raiconi, S. Voß, 2018.