Federica Ricca

Eur. J. Oper. Res., January, 2024

Managing ESG ratings disagreement in sustainable portfolio selection.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2024

2023

Connected graph partitioning with aggregated and non-aggregated gap objective functions.

[BibT_eX]

[DOI]

Networks, December, 2023

2022

A combinatorial optimization approach to scenario filtering in portfolio selection.

[BibT_eX]

[DOI]

Moisés Rodríguez-Madrena

Comput. Oper. Res., 2022

2021

Locating a discrete subtree of minimum variance on trees: New strategies to tackle a very hard problem.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

On finding connected balanced partitions of trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2021

Mathematical political districting taking care of minority groups.

[BibT_eX]

[DOI]

Verónica Arredondo

Miguel Martínez-Panero

Teresa Peña

Ann. Oper. Res., 2021

2018

Uniform and most uniform partitions of trees.

[BibT_eX]

[DOI]

Discret. Optim., 2018

Mathematical programming formulations for the efficient solution of the <i>k</i>-sum approval voting problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

2017

Mathematical Programming formulations for the efficient solution of the $k$-sum approval voting problem.

[BibT_eX]

[DOI]

CoRR, 2017

A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2017

2016

Partitioning a graph into connected components with fixed centers and optimizing cost-based objective functions or equipartition criteria.

[BibT_eX]

[DOI]

Networks, 2016

Algorithms for uniform centered partitions of trees.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2016

2014

Reliability problems in multiple path-shaped facility location on networks.

[BibT_eX]

[DOI]

Discret. Optim., 2014

Unreliable point facility location problems on networks.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Bidimensional allocation of seats via zero-one matrices with given line sums.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2014

Mathematical modeling of electoral systems: analysis, evaluation, optimization. In memory of Bruno Simeone (1945-2010).

[BibT_eX]

[DOI]

Friedrich Pukelsheim

Ann. Oper. Res., 2014

2012

Network flow methods for electoral systems.

[BibT_eX]

[DOI]

Networks, 2012

Range minimization problems in path-facility location on trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Minimax regret path location on trees.

[BibT_eX]

[DOI]

Networks, 2011

Locating median paths on connected outerplanar graphs.

[BibT_eX]

[DOI]

Networks, 2011

The give-up problem for blocked regional lists with multi-winners.

[BibT_eX]

[DOI]

Math. Soc. Sci., 2011

Political districting: from classical models to recent approaches.

[BibT_eX]

[DOI]

4OR, 2011

Incompatibility graphs and data mining.

[BibT_eX]

[DOI]

Endre Boros

Vincenzo Spinelli

Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial optimization. Extended Abstracts, 2011

2009

The continuous and discrete path-variance problems on trees.

[BibT_eX]

[DOI]

Networks, 2009

Extensive facility location problems on networks with equity measures.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Bicolored graph partitioning, or: gerrymandering at its worst.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

2008

Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs.

[BibT_eX]

[DOI]

Networks, 2008

On the complexity of general matrix scaling and entropy minimization via the RAS algorithm.

[BibT_eX]

[DOI]

Math. Program., 2008

Weighted Voronoi region algorithms for political districting.

[BibT_eX]

[DOI]

Math. Comput. Model., 2008

Local search algorithms for political districting.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

Comparing different metaheuristic approaches for the median path problem with bounded length.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2008

2002

The Forest Wrapping Problem on Outerplanar Graphs.

[BibT_eX]

[DOI]