Product
Help
Pricing
About
Jobs
Log in
Get started
Author
Add to collection
Andrea Raiconi
Observed names:
A. Raiconi,
Raiconi, Andrea
Institution:
National Research Council
Observed institutions:
University of Salerno,
Istituto per le Applicazioni del Calcolo Mauro Picone,
Laboratoire des Sciences et Techniques de l’Information de la Communication et de la Connaissance,
National Research Council,
Sapienza University of Rome
ORCID:
0000-0002-7188-8794
Observed ORCID:
0000-0002-7188-8794
OpenAlex ID:
A5010736650
Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges
2012
·
R. Cerulli
, R. De Donato
, et al.
·
European Journal of Operational Research
·
95
Contrasting the Spread of Misinformation in Online Social Networks
2020
·
Marco Amoruso
, Daniele Anello
, et al.
·
Journal of Artificial Intelligence Research
·
48
PDF
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach
2018
·
Francesco Carrabs
, Raffaele Cerulli
, et al.
·
Annals of Operations Research
·
44
α-Coverage to extend network lifetime on wireless sensor networks
2011
·
Monica Gentili
, Andrea Raiconi
·
Optimization Letters
·
44
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints
2015
·
Francesco Carrabs
, Raffaele Cerulli
, et al.
·
Journal of Network and Computer Applications
·
43
Relations, models and a memetic approach for three degree-dependent spanning tree problems
2013
·
C. Cerrone
, R. Cerulli
, et al.
·
European Journal of Operational Research
·
36
Maximizing lifetime in wireless sensor networks with multiple sensor families
2015
·
Francesco Carrabs
, Raffaele Cerulli
, et al.
·
Computers & Operations Research
·
33
Maximum Flow Problems and an NP-Complete Variant on Edge-Labeled Graphs
2013
·
Donatella Granata
, Raffaele Cerulli
, et al.
·
Springer eBooks
·
31
Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks
2011
·
Andrea Raiconi
, Monica Gentili
·
Lecture notes in computer science
·
28
Maximizing lifetime and handling reliability in wireless sensor networks
2014
·
Raffaele Cerulli
, Monica Gentili
, et al.
·
Networks
·
27
A hybrid metaheuristic for the Knapsack Problem with Forfeits
2021
·
Giovanni Capobianco
, Ciriaco D’Ambrosio
, et al.
·
Soft Computing
·
26
The Knapsack Problem with Forfeits
2020
·
Raffaele Cerulli
, Ciriaco D’Ambrosio
, et al.
·
Lecture notes in computer science
·
24
The Knapsack Problem with forfeit sets
2022
·
Ciriaco D’Ambrosio
, Federica Laureana
, et al.
·
Computers & Operations Research
·
23
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem
2006
·
R. Cerulli
, P. Dell'Olmo
, et al.
·
Electronic Notes in Discrete Mathematics
·
23
Heuristics for the strong generalized minimum label spanning tree problem
2019
·
Carmine Cerrone
, Ciriaco D'Ambrosio
, et al.
·
Networks
·
19
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
2017
·
Francesco Carrabs
, Raffaele Cerulli
, et al.
·
RAIRO - Operations Research
·
17
PDF
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints
2016
·
Francesco Carrabs
, Raffaele Cerulli
, et al.
·
Optimization Letters
·
17
Extending Lifetime Through Partial Coverage And Roles Allocation in Connectivity-Constrained Sensor Networks
2016
·
Francesco Carrabs
, Raffaele Cerulli
, et al.
·
IFAC-PapersOnLine
·
16
The k-labeled Spanning Forest Problem
2014
·
R. Cerulli
, A. Fink
, et al.
·
Procedia - Social and Behavioral Sciences
·
16
PDF
Column Generation Embedding Carousel Greedy for the Maximum Network Lifetime Problem with Interference Constraints
2017
·
Francesco Carrabs
, Carmine Cerrone
, et al.
·
Springer proceedings in mathematics & statistics
·
15
Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints
2017
·
Francesco Carrabs
, Raffaele Cerulli
, et al.
·
Lecture notes in computer science
·
10
Comparison of heuristics for the colourful travelling salesman problem
2013
·
J. Silberholz
, A. Raiconi
, et al.
·
International Journal of Metaheuristics
·
10
A biased random-key genetic algorithm for the knapsack problem with forfeit sets
2024
·
Raffaele Cerulli
, Ciriaco D’Ambrosio
, et al.
·
Soft Computing
·
8
PDF
A two-level metaheuristic for the all colors shortest path problem
2018
·
F. Carrabs
, R. Cerulli
, et al.
·
Computational Optimization and Applications
·
8
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations
2017
·
Andrea Raiconi
, Julia Pahl
, et al.
·
Asia Pacific Journal of Operational Research
·
6
Show more works
View as search
Works count:
41
Citation count:
687
H-index:
17
I10-index:
22
Year
Topic
Type