Zobrazeno 1 - 10
of 60
pro vyhledávání: '"Federica Ricca"'
Publikováno v:
Discrete Applied Mathematics. 289:78-92
In this paper we study the problem of finding a discrete subtree of minimum variance with bounded size of a given tree. We show that the problem is NP-hard on very simple trees and it remains difficult even if we consider the Mean Absolute Deviation
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bd6945e4bc8f0cd66b7bd44e73c42abe
https://doi.org/10.1016/j.dam.2020.09.015
https://doi.org/10.1016/j.dam.2020.09.015
Publikováno v:
idUS. Depósito de Investigación de la Universidad de Sevilla
instname
instname
Recent studies stressed the fact that covariance matrices computed from empirical financial time series appear to contain a high amount of noise. This makes the classical Markowitz Mean–Variance Optimization model unable to correctly evaluate the p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::46a03bf9a626ed083d28c40f371089b7
Autor:
Maddalena Arigoni, Maria Luisa Ratto, Federica Riccardo, Elisa Balmas, Lorenzo Calogero, Francesca Cordero, Marco Beccuti, Raffaele A. Calogero, Luca Alessandri
Publikováno v:
Scientific Data, Vol 11, Iss 1, Pp 1-8 (2024)
Abstract Single-cell RNA sequencing (scRNA-seq) has emerged as a vital tool in tumour research, enabling the exploration of molecular complexities at the individual cell level. It offers new technical possibilities for advancing tumour research with
Externí odkaz:
https://doaj.org/article/58f47d86441a49f4b33e9645c5a85d5a
Political districting (PD) is a wide studied topic in the literature since the 60s. It typically requires a multi-criteria approach, and mathematical programs are frequently suggested to model the many aspects of this difficult problem. This implies
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0edd9f330b7cf2b8fdea25e3939ca15c
http://hdl.handle.net/11573/1604228
http://hdl.handle.net/11573/1604228
Graph partitioning is a widely studied problem in the literature with several applications in real life contexts. In this paper we study the problem of partitioning a graph, with weights at its vertices, into p connected components. For each componen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0d006770ff5faf31863d349eb5ea9bdc
http://hdl.handle.net/11573/1544002
http://hdl.handle.net/11573/1544002
Publikováno v:
Computers & Operations Research. 98:127-136
In this paper we address the problem of electing a committee among a set of m candidates on the basis of the preferences of a set of n voters. We consider the approval voting method in which each voter can approve as many candidates as he likes by ex
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abdf7a4562f9aa7c105cac91cb13084e
https://doi.org/10.1016/j.cor.2018.05.014
https://doi.org/10.1016/j.cor.2018.05.014
Autor:
Federica Ricca, Andrea Scozzari
Publikováno v:
International Series in Operations Research & Management Science ISBN: 9783030343118
Political districting is a very well-known technical problem related to electoral systems in which the transformation of votes into seats depends on the subdivision of the national electoral body into a given number of smaller territorial bodies. Aft
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b8ef814a0aebd06110465e8eb97e150
https://doi.org/10.1007/978-3-030-34312-5_6
https://doi.org/10.1007/978-3-030-34312-5_6
Publikováno v:
TOP. 26:236-238
We are grateful to the discussants of this survey for providing thoughtful comments and interesting suggestions. We are pleased to note that all of them found the survey complete, well structured, and useful to provide a clear overview on the topic o
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ca266289211e8319d2c6cd8824c727d7
https://doi.org/10.1007/s11750-018-0477-4
https://doi.org/10.1007/s11750-018-0477-4
Publikováno v:
Annals of Operations Research. 248:163-187
Bootstrapping time series is one of the most acknowledged tools to study the statistical properties of an evolutive phenomenon. An important class of bootstrapping methods is based on the assumption that the sampled phenomenon evolves according to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a7c492868e1b90a56fd32ee9be110e9d
https://doi.org/10.1007/s10479-016-2181-9
https://doi.org/10.1007/s10479-016-2181-9
Publikováno v:
Networks. 67:69-81
We consider a connected graph G with n vertices, p of which are centers, while the remaining ones are units. For each unit-center pair, there is a fixed assignment cost and for each vertex there is a nonnegative weight. In this article, we study the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4591820e39f8bbc4a2a35072849d62f8
https://doi.org/10.1002/net.21661
https://doi.org/10.1002/net.21661