default search action
Andrea Scozzari
Person information
- affiliation: Niccolò Cusano University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j50]Francesco Cesarone
, Manuel Luis Martino
Managing ESG ratings disagreement in sustainable portfolio selection. Comput. Oper. Res. 170: 106766 (2024) - [j49]Federica Ricca
Portfolio optimization through a network approach: Network assortative mixing and portfolio diversification. Eur. J. Oper. Res. 312(2): 700-717 (2024) - [c13]Antonio Bruno, Claudia Caudai, Francesco Conti, Massimo Martinelli, Giuseppe Riccardo Leone, Massimo Magrini, Davide Moroni, Ch Muhammad Awais, Oscar Papini, Maria Antonietta Pascali, Gabriele Pieri, Marco Reggiannini, Marco Righi, Emanuele Salerno, Andrea Scozzari, Marco Tampucci:
Advancing Sustainability: Research Initiatives at the Signals and Images Lab. Ital-IA 2024: 499-504 - 2023
- [j48]Taia Soufiane
Comparing the ability of different remotely sensed evapotranspiration products in enhancing hydrological model performance and reducing prediction uncertainty. Ecol. Informatics 78: 102352 (2023) - [j47]Elena Fernández
Connected graph partitioning with aggregated and non-aggregated gap objective functions. Networks 82(4): 551-570 (2023) - [j46]Taia Soufiane
The Application of SWAT Model and Remotely Sensed Products to Characterize the Dynamic of Streamflow and Snow in a Mountainous Watershed in the High Atlas. Sensors 23(3): 1246 (2023) - 2022
- [j45]Justo Puerto
A combinatorial optimization approach to scenario filtering in portfolio selection. Comput. Oper. Res. 142: 105701 (2022) - [j44]Roberto Cordone
Cardinality constrained connected balanced partitions of trees under different criteria. Discret. Optim. 46: 100742 (2022) - 2021
- [j43]Justo Puerto
Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem. Discret. Appl. Math. 289: 78-92 (2021) - [j42]Maurizio Bruglieri, Roberto Cordone, Isabella Lari
On finding connected balanced partitions of trees. Discret. Appl. Math. 299: 1-16 (2021) - 2020
- [j41]Justo Puerto
Clustering and portfolio selection problems: A unified framework. Comput. Oper. Res. 117: 104891 (2020) - [j40]Francesco Cesarone
An optimization-diversification approach to portfolio selection. J. Glob. Optim. 76(2): 245-265 (2020) - [c12]Andrea Scozzari, Stefano Vignudelli
Lake water level estimated by a purely radiometric measurement: an experiment with the SLSTR radiometer onboard Sentinel-3 satellites. I2MTC 2020: 1-6
2010 – 2019
- 2019
- [j39]Matteo Cavaleri, Alfredo Donno, Andrea Scozzari
Total Distance, Wiener Index and Opportunity Index in Wreath Products of Star Graphs. Electron. J. Comb. 26(1): 1 (2019) - [j38]Giulio de Felice
What Differentiates Poor and Good Outcome Psychotherapy? A Statistical-Mechanics-Inspired Approach to Psychotherapy Research. Syst. 7(2): 22 (2019) - 2018
- [j37]Diego Ponce
Mathematical programming formulations for the efficient solution of the k-sum approval voting problem. Comput. Oper. Res. 98: 127-136 (2018) - [j36]Andrea Scozzari
Complexity of some graph-based bounds on the probability of a union of events. Discret. Appl. Math. 244: 186-197 (2018) - [j35]Isabella Lari
Uniform and most uniform partitions of trees. Discret. Optim. 30: 96-107 (2018) - [c11]Esteban Salgado, Andrea Scozzari
Alternating Current Optimal Power Flow with Generator Selection. ISCO 2018: 364-375 - 2017
- [j34]Roy Cerqueti
A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping. Ann. Oper. Res. 248(1-2): 163-187 (2017) - [j33]Renato Bruni, Francesco Cesarone
On exact and approximate stochastic dominance strategies for portfolio selection. Eur. J. Oper. Res. 259(1): 322-329 (2017) - [j32]Elena Fernández
Ordered Weighted Average optimization in Multiobjective Spanning Tree Problem. Eur. J. Oper. Res. 260(3): 886-903 (2017) - [j31]Ron Abileah, Andrea Scozzari, Stefano Vignudelli
Envisat RA-2 Individual Echoes: A Unique Dataset for a Better Understanding of Inland Water Altimetry Potentialities. Remote. Sens. 9(6): 605 (2017) - [c10]Andrea Scozzari, Gianpiero Brozzo:
Making use of continuous measurements for change detection purposes: an application to water distribution networks. I2MTC 2017: 1-6 - [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
Algorithms for uniform centered partitions of trees. Electron. Notes Discret. Math. 55: 37-40 (2016) - [j29]Isabella Lari
Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria. Networks 67(1): 69-81 (2016) - [j28]Jesús Gómez-Enri
Detection and Characterization of Ship Targets Using CryoSat-2 Altimeter Waveforms. Remote. Sens. 8(3): 193 (2016) - [c9]Paolo Andreussi, Andrea Scozzari, Daniele Picciaia:
Development of an online measurement apparatus for the study of stratified flow in near-horizontal pipes. I2MTC 2016: 1-6 - 2015
- [j27]Francesco Cesarone
Linear vs. quadratic portfolio selection models with hard real-world constraints. Comput. Manag. Sci. 12(3): 345-370 (2015) - [j26]Renato Bruni, Francesco Cesarone
A linear risk-return model for enhanced indexation in portfolio optimization. OR Spectr. 37(3): 735-759 (2015) - [c8]Yuri A. Manstein, Alexander K. Manstein, Evgeniy Balkov, Grigory Panin, Andrea Scozzari:
Non-invasive measurements for shallow depth soil exploration: Development and application of an electromagnetic induction instrument. I2MTC 2015: 1395-1399 - 2014
- [j25]Isabella Lari
Bidimensional allocation of seats via zero-one matrices with given line sums. Ann. Oper. Res. 215(1): 165-181 (2014) - [j24]Justo Puerto
Unreliable point facility location problems on networks. Discret. Appl. Math. 166: 188-203 (2014) - [j23]Justo Puerto
Reliability problems in multiple path-shaped facility location on networks. Discret. Optim. 12: 61-72 (2014) - [j22]Endre Boros
Polynomially Computable Bounds for the Probability of the Union of Events. Math. Oper. Res. 39(4): 1311-1329 (2014) - [c7]Paolo Villa, Mirco Boschetti, Andrea Scozzari, Stefano Vignudelli
Analysis of vegetation dynamics in middle east area during 2002-2013 in relation to the 2007-2009 drought episode. IGARSS 2014: 4260-4263 - [c6]Andrea Scozzari, Jesús Gómez-Enri
Experimentation of a tomographic technique on envisat radar altimetry data: Oil platforms as an opportunity target. IGARSS 2014: 4477-4480 - 2013
- [j21]Federica Ricca
Political Districting: from classical models to recent approaches. Ann. Oper. Res. 204(1): 271-299 (2013) - [j20]Francesco Cesarone
A new method for mean-variance portfolio optimization with cardinality constraints. Ann. Oper. Res. 205(1): 213-234 (2013) - [j19]Andrea Scozzari
Exact and heuristic approaches for the index tracking problem with UCITS constraints. Ann. Oper. Res. 205(1): 235-250 (2013) - 2012
- [j18]Justo Puerto
Range minimization problems in path-facility location on trees. Discret. Appl. Math. 160(15): 2294-2305 (2012) - [j17]Friedrich Pukelsheim, Federica Ricca
Network flow methods for electoral systems. Networks 59(1): 73-88 (2012) - 2011
- [j16]Federica Ricca
Political districting: from classical models to recent approaches. 4OR 9(3): 223-254 (2011) - [j15]Federica Ricca
The give-up problem for blocked regional lists with multi-winners. Math. Soc. Sci. 62(1): 14-24 (2011) - [j14]Isabella Lari
Locating median paths on connected outerplanar graphs. Networks 57(3): 294-307 (2011) - [j13]Justo Puerto
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
2000 – 2009
- 2009
- [j12]Justo Puerto
Extensive facility location problems on networks with equity measures. Discret. Appl. Math. 157(5): 1069-1085 (2009) - [j11]Andrea Scozzari
On the complexity of some subgraph problems. Discret. Appl. Math. 157(17): 3531-3539 (2009) - [j10]Justo Puerto
The continuous and discrete path-variance problems on trees. Networks 53(2): 221-228 (2009) - [c4]Andrea Scozzari, Fabio Tardella:
On the Complexity of Graph-Based Bounds for the Probability Bounding Problem. CTW 2009: 235-238 - 2008
- [j9]Andrea Scozzari
A clique algorithm for standard quadratic programming. Discret. Appl. Math. 156(13): 2439-2448 (2008) - [j8]Isabella Lari
Comparing different metaheuristic approaches for the median path problem with bounded length. Eur. J. Oper. Res. 190(3): 587-597 (2008) - [j7]Federica Ricca
Weighted Voronoi region algorithms for political districting. Math. Comput. Model. 48(9-10): 1468-1477 (2008) - [c3]Isabella Lari, Federica Ricca, Andrea Scozzari, Ronald I. Becker:
Locating Median Paths on Connected Outerplanar Graphs. CTW 2008: 186-188 - 2007
- [j6]Ronald I. Becker, Isabella Lari
The location of median paths on grid graphs. Ann. Oper. Res. 150(1): 65-78 (2007) - [j5]Ronald I. Becker, Isabella Lari
Algorithms for central-median paths with bounded length on trees. Eur. J. Oper. Res. 179(3): 1208-1220 (2007) - [j4]Andrea Scozzari, Nicola Acito, Giovanni Corsini
A Novel Method Based on Voltammetry for the Qualitative Analysis of Water. IEEE Trans. Instrum. Meas. 56(6): 2688-2697 (2007) - [i1]Bruno Simeone, Federica Ricca, Andrea Scozzari:
Weighted Voronoi Region Algorithms for Political Districting. Frontiers of Electronic Voting 2007 - 2005
- [j3]Paolo Dell'Olmo, Monica Gentili, Andrea Scozzari
On finding dissimilar Pareto-optimal paths. Eur. J. Oper. Res. 162(1): 70-82 (2005) - 2002
- [j2]Ronald I. Becker, Yen-I Chiang, Isabella Lari
Finding the l-core of a tree. Discret. Appl. Math. 118(1-2): 25-42 (2002) - [j1]Ronald I. Becker, Isabella Lari
Efficient algorithms for finding the (k, l)-core of tree networks. Networks 40(4): 208-215 (2002) - [c2]Isabella Lari, Federica Ricca, Andrea Scozzari:
The Forest Wrapping Problem on Outerplanar Graphs. WG 2002: 345-354 - 2001
- [c1]Ronald I. Becker, Yen-I Chiang, Isabella Lari
The Cent-dian Path Problem on Tree Networks. ISAAC 2001: 743-755
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-10-30 20:33 CET 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: