Andrea Raiconi

571 total citations
24 papers, 321 citations indexed

About

Andrea Raiconi is a scholar working on Computer Networks and Communications, Industrial and Manufacturing Engineering and Electrical and Electronic Engineering. According to data from OpenAlex, Andrea Raiconi has authored 24 papers receiving a total of 321 indexed citations (citations by other indexed papers that have themselves been cited), including 13 papers in Computer Networks and Communications, 12 papers in Industrial and Manufacturing Engineering and 9 papers in Electrical and Electronic Engineering. Recurrent topics in Andrea Raiconi's work include Energy Efficient Wireless Sensor Networks (9 papers), Vehicle Routing Optimization Methods (8 papers) and Optimization and Packing Problems (7 papers). Andrea Raiconi is often cited by papers focused on Energy Efficient Wireless Sensor Networks (9 papers), Vehicle Routing Optimization Methods (8 papers) and Optimization and Packing Problems (7 papers). Andrea Raiconi collaborates with scholars based in Italy, Germany and United States. Andrea Raiconi's co-authors include Raffaele Cerulli, Monica Gentili, Ciriaco D’Ambrosio, Francesco Carrabs, Carmine Cerrone, Diodato Ferraioli, Vincenzo Auletta, Paolo Dell’Olmo, Andréas Fink and Luigi Pavone and has published in prestigious journals such as Bioinformatics, European Journal of Operational Research and Computers & Operations Research.

In The Last Decade

Andrea Raiconi

23 papers receiving 319 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
Andrea Raiconi Italy 11 209 149 87 56 35 24 321
M. Carmen Ruiz Spain 7 136 0.7× 56 0.4× 60 0.7× 27 0.5× 22 0.6× 30 256
Luca Tavanti Italy 9 279 1.3× 175 1.2× 29 0.3× 17 0.3× 16 0.5× 32 371
Samar Abdi United States 9 201 1.0× 82 0.6× 12 0.1× 52 0.9× 33 0.9× 41 436
Morteza Babazadeh Shareh Iran 7 212 1.0× 87 0.6× 37 0.4× 14 0.3× 69 2.0× 9 337
Irith Ben‐Arroyo Hartman Israel 9 45 0.2× 46 0.3× 38 0.4× 128 2.3× 23 0.7× 23 265
Xin Han China 13 271 1.3× 32 0.2× 338 3.9× 45 0.8× 21 0.6× 57 463
Tiberiu Seceleanu Sweden 12 233 1.1× 81 0.5× 50 0.6× 25 0.4× 55 1.6× 73 389
Deepak Mehta Ireland 9 222 1.1× 201 1.3× 21 0.2× 9 0.2× 41 1.2× 47 368
Paolo Nobili Italy 8 59 0.3× 40 0.3× 132 1.5× 76 1.4× 37 1.1× 23 238
Steven Chamberland Canada 12 271 1.3× 229 1.5× 43 0.5× 19 0.3× 17 0.5× 61 384

Countries citing papers authored by Andrea Raiconi

Since Specialization
Citations

This map shows the geographic impact of Andrea Raiconi's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Andrea Raiconi with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Andrea Raiconi more than expected).

Fields of papers citing papers by Andrea Raiconi

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by Andrea Raiconi. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Andrea Raiconi. The network helps show where Andrea Raiconi may publish in the future.

Co-authorship network of co-authors of Andrea Raiconi

This figure shows the co-authorship network connecting the top 25 collaborators of Andrea Raiconi. A scholar is included among the top collaborators of Andrea Raiconi based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Andrea Raiconi. Andrea Raiconi is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

20 of 20 papers shown
1.
Raiconi, Andrea, et al.. (2025). Bi-objective knapsack problem with conflicts. Annals of Operations Research. 357(2-3). 979–1001.
2.
Cerulli, Raffaele, Ciriaco D’Ambrosio, & Andrea Raiconi. (2024). A biased random-key genetic algorithm for the knapsack problem with forfeit sets. Soft Computing. 28(20). 12021–12041. 2 indexed citations
3.
Raiconi, Andrea, et al.. (2023). A heuristic algorithm solving the mutual-exclusivity-sorting problem. Bioinformatics. 39(1). 3 indexed citations
4.
D’Ambrosio, Ciriaco, et al.. (2022). The Knapsack Problem with forfeit sets. Computers & Operations Research. 151. 106093–106093. 9 indexed citations
5.
Capobianco, Giovanni, et al.. (2021). A hybrid metaheuristic for the Knapsack Problem with Forfeits. Soft Computing. 26(2). 749–762. 14 indexed citations
6.
Auletta, Vincenzo, et al.. (2020). Contrasting the Spread of Misinformation in Online Social Networks. Journal of Artificial Intelligence Research. 69. 847–879. 19 indexed citations
7.
Carrabs, Francesco, Ciriaco D’Ambrosio, & Andrea Raiconi. (2020). Optimization of sensor battery charging to maximize lifetime in a wireless sensors network. Optimization Letters. 15(5). 1587–1600. 2 indexed citations
8.
Cerrone, Carmine, Ciriaco D’Ambrosio, & Andrea Raiconi. (2019). Heuristics for the strong generalized minimum label spanning tree problem. Networks. 74(2). 148–160. 11 indexed citations
9.
Carrabs, Francesco, et al.. (2018). Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Annals of Operations Research. 298(1-2). 65–78. 22 indexed citations
10.
Carrabs, Francesco, et al.. (2018). A two-level metaheuristic for the all colors shortest path problem. Computational Optimization and Applications. 71(2). 525–551. 6 indexed citations
11.
Raiconi, Andrea, Julia Pahl, Monica Gentili, Stefan Voß, & Raffaele Cerulli. (2017). Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations. Asia Pacific Journal of Operational Research. 34(5). 1750019–1750019. 4 indexed citations
12.
Carrabs, Francesco, Raffaele Cerulli, Ciriaco D’Ambrosio, & Andrea Raiconi. (2016). An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. Optimization Letters. 11(7). 1341–1356. 8 indexed citations
13.
Carrabs, Francesco, Raffaele Cerulli, Ciriaco D’Ambrosio, Monica Gentili, & Andrea Raiconi. (2015). Maximizing lifetime in wireless sensor networks with multiple sensor families. Computers & Operations Research. 60. 121–137. 24 indexed citations
14.
Cerulli, Raffaele, Monica Gentili, & Andrea Raiconi. (2014). Maximizing lifetime and handling reliability in wireless sensor networks. Networks. 64(4). 321–338. 16 indexed citations
15.
Cerulli, Raffaele, Andréas Fink, Monica Gentili, & Andrea Raiconi. (2014). The k-labeled Spanning Forest Problem. Procedia - Social and Behavioral Sciences. 108. 153–163. 6 indexed citations
16.
Cerrone, Carmine, Raffaele Cerulli, & Andrea Raiconi. (2013). Relations, models and a memetic approach for three degree-dependent spanning tree problems. European Journal of Operational Research. 232(3). 442–453. 18 indexed citations
17.
Silberholz, John, et al.. (2013). Comparison of heuristics for the colourful travelling salesman problem. 2(2). 141–141. 7 indexed citations
18.
Cerulli, Raffaele, et al.. (2012). Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges. European Journal of Operational Research. 220(1). 58–66. 61 indexed citations
19.
Gentili, Monica & Andrea Raiconi. (2011). α-Coverage to extend network lifetime on wireless sensor networks. Optimization Letters. 7(1). 157–172. 28 indexed citations
20.
Cerulli, Raffaele, Paolo Dell’Olmo, Monica Gentili, & Andrea Raiconi. (2006). Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. Electronic Notes in Discrete Mathematics. 25. 131–138. 13 indexed citations

Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.

Explore authors with similar magnitude of impact

Breakdown of academic impact, for papers by M. Carmen Ruiz Breakdown of academic impact, for papers by Luca Tavanti Breakdown of academic impact, for papers by Samar Abdi Breakdown of academic impact, for papers by Morteza Babazadeh Shareh Breakdown of academic impact, for papers by Irith Ben‐Arroyo Hartman Breakdown of academic impact, for papers by Xin Han Breakdown of academic impact, for papers by Tiberiu Seceleanu Breakdown of academic impact, for papers by Deepak Mehta Breakdown of academic impact, for papers by Paolo Nobili Breakdown of academic impact, for papers by Steven Chamberland
Rankless by CCL
2026