default search action
Andrea Raiconi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Alessandro Vinceti, Lucia Trastulla
, Umberto Perron, Andrea Raiconi
A heuristic algorithm solving the mutual-exclusivity-sorting problem. Bioinform. 39(1) (2023) - [j19]Ciriaco D'Ambrosio
The Knapsack Problem with forfeit sets. Comput. Oper. Res. 151: 106093 (2023) - 2022
- [j18]Giovanni Capobianco, Ciriaco D'Ambrosio
A hybrid metaheuristic for the Knapsack Problem with Forfeits. Soft Comput. 26(2): 749-762 (2022) - 2021
- [j17]Francesco Carrabs
Minimum spanning tree with conflicting edge pairs: a branch-and-cut approach. Ann. Oper. Res. 298(1): 65-78 (2021) - [j16]Francesco Carrabs
Optimization of sensor battery charging to maximize lifetime in a wireless sensors network. Optim. Lett. 15(5): 1587-1600 (2021) - [j15]Francesco Carrabs
A reduction heuristic for the all-colors shortest path problem. RAIRO Oper. Res. 55(Supplement): S2071-S2082 (2021) - 2020
- [j14]Marco Amoruso, Daniele Anello, Vincenzo Auletta, Raffaele Cerulli, Diodato Ferraioli, Andrea Raiconi:
Contrasting the Spread of Misinformation in Online Social Networks. J. Artif. Intell. Res. 69: 847-879 (2020) - [c3]Raffaele Cerulli, Ciriaco D'Ambrosio
The Knapsack Problem with Forfeits. ISCO 2020: 263-272
2010 – 2019
- 2019
- [j13]Carmine Cerrone
Heuristics for the strong generalized minimum label spanning tree problem. Networks 74(2): 148-160 (2019) - 2018
- [j12]Francesco Carrabs
A two-level metaheuristic for the all colors shortest path problem. Comput. Optim. Appl. 71(2): 525-551 (2018) - [e1]Raffaele Cerulli, Andrea Raiconi, Stefan Voß:
Computational Logistics - 9th International Conference, ICCL 2018, Vietri sul Mare, Italy, October 1-3, 2018, Proceedings. Lecture Notes in Computer Science 11184, Springer 2018, ISBN 978-3-030-00897-0 [contents] - 2017
- [j11]Andrea Raiconi, Julia Pahl
Tactical Production and Lot Size Planning with Lifetime Constraints: A Comparison of Model Formulations. Asia Pac. J. Oper. Res. 34(5): 1750019:1-1750019:24 (2017) - [j10]Francesco Carrabs
An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints. Optim. Lett. 11(7): 1341-1356 (2017) - [j9]Francesco Carrabs
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints. RAIRO Oper. Res. 51(3): 607-625 (2017) - [c2]Francesco Carrabs
Prolonging Lifetime in Wireless Sensor Networks with Interference Constraints. GPC 2017: 285-297 - 2015
- [j8]Francesco Carrabs
Maximizing lifetime in wireless sensor networks with multiple sensor families. Comput. Oper. Res. 60: 121-137 (2015) - [j7]Francesco Carrabs
A hybrid exact approach for maximizing lifetime in sensor networks with complete and partial coverage constraints. J. Netw. Comput. Appl. 58: 12-22 (2015) - 2014
- [j6]Carmine Cerrone
Relations, models and a memetic approach for three degree-dependent spanning tree problems. Eur. J. Oper. Res. 232(3): 442-453 (2014) - [j5]Raffaele Cerulli
Maximizing lifetime and handling reliability in wireless sensor networks. Networks 64(4): 321-338 (2014) - 2013
- [j4]John Silberholz, Andrea Raiconi
Comparison of heuristics for the colourful travelling salesman problem. Int. J. Metaheuristics 2(2): 141-173 (2013) - [j3]Monica Gentili, Andrea Raiconi
α-Coverage to extend network lifetime on wireless sensor networks. Optim. Lett. 7(1): 157-172 (2013) - 2012
- [j2]Raffaele Cerulli
Exact and heuristic methods to maximize network lifetime in wireless sensor networks with adjustable sensing ranges. Eur. J. Oper. Res. 220(1): 58-66 (2012) - 2011
- [c1]Andrea Raiconi
Exact and Metaheuristic Approaches to Extend Lifetime and Maintain Connectivity in Wireless Sensors Networks. INOC 2011: 607-619
2000 – 2009
- 2006
- [j1]Raffaele Cerulli
Heuristic approaches for the Minimum Labelling Hamiltonian Cycle Problem. Electron. Notes Discret. Math. 25: 131-138 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:45 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: