default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernardetta Addis
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j26]Bernardetta Addis
, Christophe Castel, Amalia Macali, Ruth Misener, Veronica Piccialli:
Data augmentation driven by optimization for membrane separation process synthesis. Comput. Chem. Eng. 177: 108342 (2023)- 2022
- [c11]Nour-El-Houda Yellas, Bernardetta Addis, Roberto Riggio, Stefano Secci:
Function Placement and Acceleration for In-Network Federated Learning Services. CNSM 2022: 212-218 - [c10]Meihui Gao, Yanjun Li, Bernardetta Addis, Giuliana Carello, Shuguo Zhuo:
Take the road back: a different way to study the NFV service chaining problem. WCNC 2022: 1266-1271 - 2021
- [j25]Bernardetta Addis, Giuliana Carello, Meihui Gao:
ILP-based heuristics for a virtual network function placement and routing problem. Networks 78(3): 328-349 (2021) - 2020
- [j24]Bernardetta Addis, Giuliana Carello, Meihui Gao:
On a virtual network functions placement and routing problem: Some properties and a comparison of two formulations. Networks 75(2): 158-182 (2020)
2010 – 2019
- 2018
- [b2]Bernardetta Addis:
A journey through optimization: from global to discrete optimization and back. University of Lorraine, Nancy, France, 2018 - [j23]Meihui Gao, Bernardetta Addis, Mathieu Bouet, Stefano Secci:
Optimal orchestration of virtual network functions. Comput. Networks 142: 108-127 (2018) - [j22]Bernardetta Addis, Meihui Gao, Giuliana Carello:
On the complexity of a Virtual Network Function Placement and Routing problem. Electron. Notes Discret. Math. 69: 197-204 (2018) - 2017
- [j21]Bernardetta Addis, Giuliana Carello, Sara Mattia:
Survivable green traffic engineering with shared protection. Networks 69(1): 6-22 (2017) - [i3]Meihui Gao, Bernardetta Addis, Mathieu Bouet, Stefano Secci:
Optimal Orchestration of Virtual Network Functions. CoRR abs/1706.04762 (2017) - 2016
- [j20]Bernardetta Addis, Roberto Aringhieri, Andrea Grosso, Pierre Hosteins:
Hybrid constructive heuristics for the critical node problem. Ann. Oper. Res. 238(1-2): 637-649 (2016) - [j19]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
Energy management in communication networks: a journey through modeling and optimization glasses. Comput. Commun. 91-92: 76-94 (2016) - [j18]Bernardetta Addis, Giuliana Carello, Sara Mattia:
Energy-aware survivable networks. Electron. Notes Discret. Math. 52: 133-140 (2016) - [c9]Evangelia Tsiontsiou, Bernardetta Addis, Ye-Qiong Song, Alberto Ceselli:
Optimal Probabilistic Energy-Aware Routing for Duty-Cycled Wireless Sensor Networks. NTMS 2016: 1-7 - 2015
- [c8]Bernardetta Addis, Dallal Belabed, Mathieu Bouet, Stefano Secci:
Virtual network functions placement and routing optimization. CloudNet 2015: 171-177 - [i2]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
Energy management in communication networks: a journey through modelling and optimization glasses. CoRR abs/1507.02636 (2015) - 2014
- [j17]Bernardetta Addis, Danilo Ardagna, Antonio Capone, Giuliana Carello:
Energy-aware joint management of networks and Cloud infrastructures. Comput. Networks 70: 75-95 (2014) - [j16]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
On the energy cost of robustness and resiliency in IP networks. Comput. Networks 75: 239-259 (2014) - [j15]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
Energy Management Through Optimized Routing and Device Powering for Greener Communication Networks. IEEE/ACM Trans. Netw. 22(1): 313-325 (2014) - [i1]Bernardetta Addis, Giuliana Carello, Antonio Capone, Luca Giovanni Gianoli, Brunilde Sansò:
Robust Energy Management for Green and Survivable IP Networks. CoRR abs/1401.1977 (2014) - 2013
- [j14]Bernardetta Addis, Marco Di Summa, Andrea Grosso:
Identifying critical nodes in undirected graphs: Complexity results and polynomial algorithms for the case of bounded treewidth. Discret. Appl. Math. 161(16-17): 2349-2360 (2013) - [j13]Bernardetta Addis, Giuliana Carello, Alberto Ceselli:
Combining very large scale and ILP based neighborhoods for a two-level location problem. Eur. J. Oper. Res. 231(3): 535-546 (2013) - [j12]Bernardetta Addis, Danilo Ardagna, Barbara Panicucci, Mark S. Squillante, Li Zhang:
A Hierarchical Approach for the Resource Management of Very Large Cloud Platforms. IEEE Trans. Dependable Secur. Comput. 10(5): 253-272 (2013) - [c7]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
A robust optimization approach for energy-aware routing in MPLS networks. ICNC 2013: 567-572 - 2012
- [j11]Bernardetta Addis, Giuliana Carello, Alberto Ceselli:
Exactly solving a two-level location problem with modular node capacities. Networks 59(1): 161-180 (2012) - [c6]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
Energy-aware multiperiod traffic engineering with flow-based routing. ICC 2012: 5957-5961 - [c5]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
Energy aware management of resilient networks with shared protection. SustainIT 2012: 1-9 - [c4]Bernardetta Addis, Antonio Capone, Giuliana Carello, Luca Giovanni Gianoli, Brunilde Sansò:
Multi-period traffic engineering of resilient networks for energy efficiency. OnlineGreenComm 2012: 14-19 - 2011
- [j10]Bernardetta Addis, Andrea Cassioli, Marco Locatelli, Fabio Schoen:
A global optimization method for the design of space trajectories. Comput. Optim. Appl. 48(3): 635-652 (2011) - [c3]Bernardetta Addis, Giuliana Carello, Federico Malucelli:
Network design with SRG based protection. CTW 2011: 27-31 - [c2]Bernardetta Addis, Giuliana Carello, Federico Malucelli:
SRG-Disjoint Design with Dedicated and Shared Protection. INOC 2011: 18-23 - 2010
- [j9]Bernardetta Addis, Werner Schachinger:
Morse potential energy minimization: Improved bounds for optimal configurations. Comput. Optim. Appl. 47(1): 129-131 (2010) - [c1]Bernardetta Addis, Danilo Ardagna, Barbara Panicucci, Li Zhang:
Autonomic Management of Cloud Service Centers with Availability Guarantees. IEEE CLOUD 2010: 220-227
2000 – 2009
- 2009
- [j8]Bernardetta Addis, Werner Schachinger:
Improved bounds for interatomic distance in Morse clusters. Oper. Res. Lett. 37(4): 290-294 (2009) - 2008
- [j7]Bernardetta Addis, Marco Locatelli, Fabio Schoen:
Disk Packing in a Square: A New Global Optimization Approach. INFORMS J. Comput. 20(4): 516-524 (2008) - [j6]Bernardetta Addis, Marco Locatelli, Fabio Schoen:
Efficiently packing unequal disks in a circle. Oper. Res. Lett. 36(1): 37-42 (2008) - 2007
- [j5]Werner Schachinger, Bernardetta Addis, Immanuel M. Bomze, Fabio Schoen:
New results for molecular formation under pairwise potential minimization. Comput. Optim. Appl. 38(3): 329-349 (2007) - [j4]Bernardetta Addis, Marco Locatelli:
A new class of test functions for global optimization. J. Glob. Optim. 38(3): 479-501 (2007) - 2006
- [j3]Bernardetta Addis, Sven Leyffer:
A Trust-Region Algorithm for Global Optimization. Comput. Optim. Appl. 35(3): 287-304 (2006) - 2005
- [b1]Bernardetta Addis:
Global optimization using local searches. University of Florence, Italy, 2005 - [j2]Bernardetta Addis, Marco Locatelli, Fabio Schoen:
Local optima smoothing for global optimization. Optim. Methods Softw. 20(4-5): 417-437 (2005) - 2004
- [j1]Bernardetta Addis, Fabio Schoen:
Docking of Atomic Clusters Through Nonlinear Optimization. J. Glob. Optim. 30(1): 1-21 (2004)
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:42 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:
