default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDValeria Leggieri
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j13]Angelo Cardellicchio
, Sergio Ruggieri, Valeria Leggieri, Giuseppina Uva:
View VULMA: Data Set for Training a Machine-Learning Tool for a Fast Vulnerability Analysis of Existing Buildings. Data 7(1): 4 (2022)
2010 – 2019
- 2019
- [c2]Giuseppina Uva, Francesco Iannone, Valeria Leggieri:
Integrated assessment of energy performance and seismic vulnerability of existing building stock at urban scale through BIM: an application to "Fiera del Levante". SMC 2019: 964-969 - [c1]Giuseppina Uva, Valentino Sangiorgio, Pier Luigi Ciampoli, Valeria Leggieri, Sergio Ruggieri:
A novel rapid survey form for the vulnerability assessment of existing building stock based on the "Index Building" approach. SMC 2019: 976-981 - 2018
- [j12]Valeria Leggieri, Mohamed Haouari:
A matheuristic for the asymmetric capacitated vehicle routing problem. Discret. Appl. Math. 234: 139-150 (2018) - 2017
- [j11]Valeria Leggieri, Mohamed Haouari:
Lifted polynomial size formulations for the homogeneous and heterogeneous vehicle routing problems. Eur. J. Oper. Res. 263(3): 755-767 (2017) - 2014
- [j10]Valeria Leggieri, Mohamed Haouari, Chefi Triki:
The Steiner Tree Problem with Delays: A compact formulation and reduction procedures. Discret. Appl. Math. 164: 178-190 (2014) - 2012
- [j9]Valeria Leggieri, Mohamed Haouari, Chefi Triki:
A branch-and-cut algorithm for the Steiner tree problem with delays. Optim. Lett. 6(8): 1753-1771 (2012) - 2011
- [j8]János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki:
Minimum power multicasting in wireless networks under probabilistic node failures. Comput. Optim. Appl. 49(1): 193-212 (2011) - [j7]Roberto Montemanni, Valeria Leggieri:
A branch and price algorithm for the minimum power multicasting problem in wireless sensor networks. Math. Methods Oper. Res. 74(3): 327-342 (2011) - 2010
- [j6]Roberto Montemanni, Valeria Leggieri:
An exact algorithm for the Minimum Power Multicasting Problem in Wireless Sensor Networks. Electron. Notes Discret. Math. 36: 215-222 (2010) - [j5]Valeria Leggieri, Mohamed Haouari, Chefi Triki:
An Exact Algorithm for the Steiner Tree Problem with Delays. Electron. Notes Discret. Math. 36: 223-230 (2010) - [j4]János Barta, Valeria Leggieri, Roberto Montemanni, Paolo Nobili, Chefi Triki:
Some Valid Inequalities for the Probabilistic Minimum Power Multicasting Problem. Electron. Notes Discret. Math. 36: 463-470 (2010)
2000 – 2009
- 2009
- [j3]Valeria Leggieri:
Multicast problems in telecommunication networks. 4OR 7(1): 105-108 (2009) - 2008
- [j2]Roberto Montemanni, Valeria Leggieri, Chefi Triki:
Mixed integer formulations for the probabilistic minimum energy broadcast problem in wireless networks. Eur. J. Oper. Res. 190(2): 578-585 (2008) - [j1]Valeria Leggieri, Paolo Nobili, Chefi Triki:
Minimum power multicasting problem in wireless networks. Math. Methods Oper. Res. 68(2): 295-311 (2008)
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:59 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:
