Остановите войну!
for scientists:
default search action
Andrea Scozzari
- > Home > Persons > Andrea Scozzari
Publications
- 2023
- [j47]Elena Fernández, Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Connected graph partitioning with aggregated and non-aggregated gap objective functions. Networks 82(4): 551-570 (2023) - 2022
- [j45]Justo Puerto, Federica Ricca, Moisés Rodríguez-Madrena, Andrea Scozzari:
A combinatorial optimization approach to scenario filtering in portfolio selection. Comput. Oper. Res. 142: 105701 (2022) - 2021
- [j43]Justo Puerto, Federica Ricca, Andrea Scozzari:
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem. Discret. Appl. Math. 289: 78-92 (2021) - 2020
- [j41]Justo Puerto, Moisés Rodríguez-Madrena, Andrea Scozzari:
Clustering and portfolio selection problems: A unified framework. Comput. Oper. Res. 117: 104891 (2020) - 2018
- [j37]Diego Ponce, Justo Puerto, Federica Ricca, Andrea Scozzari:
Mathematical programming formulations for the efficient solution of the k-sum approval voting problem. Comput. Oper. Res. 98: 127-136 (2018) - [j35]Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Uniform and most uniform partitions of trees. Discret. Optim. 30: 96-107 (2018) - 2017
- [j32]Elena Fernández, Miguel A. Pozo, Justo Puerto, Andrea Scozzari:
Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem. Eur. J. Oper. Res. 260(3): 886-903 (2017) - [i2]Diego Ponce, Justo Puerto, Federica Ricca, Andrea Scozzari:
Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem. CoRR abs/1707.09225 (2017) - 2016
- [j30]Isabella Lari, Justo Puerto, Federica Ricca, Andrea Scozzari:
Algorithms for uniform centered partitions of trees. Electron. Notes Discret. Math. 55: 37-40 (2016) - [j29]Isabella Lari, Federica Ricca, Justo Puerto, Andrea Scozzari:
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria. Networks 67(1): 69-81 (2016) - 2014
- [j24]Justo Puerto, Federica Ricca, Andrea Scozzari:
Unreliable point facility location problems on networks. Discret. Appl. Math. 166: 188-203 (2014) - [j23]Justo Puerto, Federica Ricca, Andrea Scozzari:
Reliability problems in multiple path-shaped facility location on networks. Discret. Optim. 12: 61-72 (2014) - 2012
- [j18]Justo Puerto, Federica Ricca, Andrea Scozzari:
Range minimization problems in path-facility location on trees. Discret. Appl. Math. 160(15): 2294-2305 (2012) - 2011
- [j13]Justo Puerto, Federica Ricca, Andrea Scozzari:
Minimax regret path location on trees. Networks 58(2): 147-158 (2011) - [c5]Justo Puerto, Federica Ricca, Andrea Scozzari:
Range minimization problems in path-facility location on trees. CTW 2011: 231-234 - 2009
- [j12]Justo Puerto, Federica Ricca, Andrea Scozzari:
Extensive facility location problems on networks with equity measures. Discret. Appl. Math. 157(5): 1069-1085 (2009) - [j10]Justo Puerto, Federica Ricca, Andrea Scozzari:
The continuous and discrete path-variance problems on trees. Networks 53(2): 221-228 (2009)
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-03-24 02:47 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint