Zobrazeno 1 - 10
of 101
pro vyhledávání: '"Bruno Simeone"'
Publikováno v:
Annals of Operations Research. 217:253-262
This paper is devoted to a new problem of combinatorial optimization. The problem is called Maximum Weight Archipelago Subgraph Problem (MWASP). Archipelago is a signed graph such that the negative edges connect the components of the graph of the pos
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::3e291438d3887c2aed2b66366a2493d0
https://doi.org/10.1007/s10479-013-1518-x
https://doi.org/10.1007/s10479-013-1518-x
Publikováno v:
Mathematical Social Sciences. 62:14-24
The current electoral law for the Italian Parliament prescribes blocked, linearly ordered lists of candidates for each party within each constituency. The peculiarity of the Italian electoral system is that a party can present the same candidate in d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::34be322bd23871299d0f45b795f8656d
https://doi.org/10.1016/j.mathsocsci.2011.04.005
https://doi.org/10.1016/j.mathsocsci.2011.04.005
Publikováno v:
Discrete Applied Mathematics. 157:3601-3614
This study is motivated by an electoral application where we look into the following question: how much biased can the assignment of parliament seats be in a majority system under the effect of vicious gerrymandering when the two competing parties ha
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::596e49fe09a9eea60f712d485792f6b6
https://doi.org/10.1016/j.dam.2009.06.016
https://doi.org/10.1016/j.dam.2009.06.016
Publikováno v:
Discrete Applied Mathematics. 157:991-1008
Clustering problems with relational constraints in which the underlying graph is a tree arise in a variety of applications: hierarchical data base paging, communication and distribution networks, districting, biological taxonomy, and others. They are
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::094407cfe77f865a59fb9e5d0ad3ce2a
https://doi.org/10.1016/j.dam.2008.03.032
https://doi.org/10.1016/j.dam.2008.03.032
Publikováno v:
Mathematical and Computer Modelling. 48:1468-1477
Political districting on a given territory can be modelled as bi-objective partitioning of a graph into connected components. The nodes of the graph represent territorial units and are weighted by populations; edges represent pairs of geographically
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8261c1221600da2ab197ac482736bc47
https://doi.org/10.1016/j.mcm.2008.05.041
https://doi.org/10.1016/j.mcm.2008.05.041
Autor:
Federica Ricca, Bruno Simeone
Publikováno v:
European Journal of Operational Research. 189:1409-1426
Electoral district planning plays an important role in a political election, especially when a majority voting rule is adopted, because it interferes in the translation of votes into seats. The practice of gerrymandering can easily take place if the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b69dcc979f43e88d666941fdf48c1d15
https://doi.org/10.1016/j.ejor.2006.08.065
https://doi.org/10.1016/j.ejor.2006.08.065
Publikováno v:
Discrete Applied Mathematics. 144:79-102
Patterns are the key building blocks in the logical analysis of data (LAD). It has been observed in empirical studies and practical applications that some patterns are more “suitable” than others for use in LAD. In this paper, we model various su
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::1a592f04f3aee4c74aa62def0b740066
https://doi.org/10.1016/j.dam.2003.08.013
https://doi.org/10.1016/j.dam.2003.08.013
Publikováno v:
Networks. 44:120-131
In this article we continue our study on the complexity of Path Covering Problems started in 2. Here, taking one further step, we investigate the complexity of the problem on grids. For special classes of grids (general grids, grids with a fixed numb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::8ee7f32b1f050c2ce07bd579cd8e26e3
https://doi.org/10.1002/net.20022
https://doi.org/10.1002/net.20022
Publikováno v:
Journal of Classification. 20:143-180
Consider N entities to be classified (e.g., geographical areas), a matrix of dissimilarities between pairs of entities, a graph H with vertices associated with these entities such that the edges join the vertices corresponding to contiguous entities.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::023e6fda4988e51431343000abbe4919
https://doi.org/10.1007/s00357-003-0011-7
https://doi.org/10.1007/s00357-003-0011-7