![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Antonella Nardin
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j4]Antonella Nardin
, Fabio D'Andreagiovanni
:
A Quantum-Inspired Ant Colony Optimization Algorithm for Parking Lot Rental to Shared E-Scooter Services. Algorithms 17(2): 80 (2024) - 2022
- [c7]Fabio D'Andreagiovanni, Hicham Lakhlef, Antonella Nardin:
Green and robust optimal design of Single Frequency Networks by min-max regret and ACO-based learning. ISC2 2022: 1-7 - [c6]Fabio D'Andreagiovanni
, Hicham Lakhlef
, Antonella Nardin
:
Green Design of Single Frequency Networks by Multiband Robustness and a Hybrid Metaheuristic. WIVACE 2022: 219-231 - 2021
- [c5]Stefano Carrese, Fabio D'Andreagiovanni, Antonella Nardin, Tommaso Giacchetti, Leonardo Zamberlan:
Seek & Beautify: integrating UAVs in the optimal beautification of e-scooter sharing fleets. MT-ITS 2021: 1-6 - 2020
- [j3]Fabio D'Andreagiovanni
, Hicham Lakhlef
, Antonella Nardin
:
A Matheuristic for Joint Optimal Power and Scheduling Assignment in DVB-T2 Networks. Algorithms 13(1): 27 (2020) - [c4]Fabio D'Andreagiovanni, Hicham Lakhlef, Antonella Nardin:
A Robust Optimization Approach for Designing FTTx Networks Integrating Free Space Optics under Weather Uncertainty. Q2SWinet 2020: 7-13
2010 – 2019
- 2018
- [c3]Fabio D'Andreagiovanni, Antonella Nardin:
A Fast Metaheuristic for the Design of DVB-T2 Networks. EvoApplications 2018: 141-155 - [c2]Fabio D'Andreagiovanni
, Hicham Lakhlef, Antonella Nardin:
A Hybrid MIP-Based Heuristic for the Optimal Design of DVB-T2 Networks. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2018: 1540-1546 - 2017
- [j2]Fabio D'Andreagiovanni
, Fabian Mett, Antonella Nardin, Jonad Pulaj:
Integrating LP-guided variable fixing with MIP heuristics in the robust design of hybrid wired-wireless FTTx access networks. Appl. Soft Comput. 61: 1074-1087 (2017) - [c1]Fabio D'Andreagiovanni
, Antonella Nardin, Enrico Natalizio:
A Fast ILP-Based Heuristic for the Robust Design of Body Wireless Sensor Networks. EvoApplications (1) 2017: 234-250 - [i2]Fabio D'Andreagiovanni, Antonella Nardin, Enrico Natalizio:
A fast ILP-based Heuristic for the robust design of Body Wireless Sensor Networks. CoRR abs/1704.04640 (2017) - 2015
- [j1]Fabio D'Andreagiovanni
, Antonella Nardin:
Towards the fast and robust optimal design of wireless body area networks. Appl. Soft Comput. 37: 971-982 (2015) - [i1]Fabio D'Andreagiovanni, Antonella Nardin:
Towards the fast and robust optimal design of Wireless Body Area Networks. CoRR abs/1504.01356 (2015)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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-24 23:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint