| Publication | Date of Publication | Type |
|---|
| Connected graph partitioning with aggregated and non‐aggregated gap objective functions | 2024-01-18 | Paper |
| Portfolio optimization through a network approach: network assortative mixing and portfolio diversification | 2023-11-14 | Paper |
| A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices | 2023-05-05 | Paper |
| A combinatorial optimization approach to scenario filtering in portfolio selection | 2022-06-22 | Paper |
| Mathematical political districting taking care of minority groups | 2021-11-09 | Paper |
| Mathematical programming formulations for practical political districting | 2021-09-08 | Paper |
| On finding connected balanced partitions of trees | 2021-05-31 | Paper |
| A combinatorial optimization approach to scenario filtering in portfolio selection | 2021-03-01 | Paper |
| Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem | 2020-12-29 | Paper |
| Uniform and most uniform partitions of trees | 2019-01-14 | Paper |
| Extensive facility location problems on networks: an updated review | 2018-08-28 | Paper |
| Rejoinder on: ``Extensive facility location problems on networks: an updated review | 2018-08-28 | Paper |
| Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem | 2018-07-12 | Paper |
| Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria | 2018-04-27 | Paper |
| A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping | 2017-03-07 | Paper |
| Algorithms for uniform centered partitions of trees | 2017-02-14 | Paper |
| Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging | 2015-05-04 | Paper |
| Reliability problems in multiple path-shaped facility location on networks | 2015-04-09 | Paper |
| Bidimensional allocation of seats via zero-one matrices with given line sums | 2014-09-26 | Paper |
| Unreliable point facility location problems on networks | 2014-02-18 | Paper |
| Political districting: from classical models to recent approaches | 2013-08-08 | Paper |
| Error minimization methods in biproportional apportionment | 2013-02-26 | Paper |
| Range minimization problems in path-facility location on trees | 2012-10-26 | Paper |
| Network flow methods for electoral systems | 2012-06-18 | Paper |
| Political districting: From classical models to recent approaches | 2012-01-10 | Paper |
| Minimax regret path location on trees | 2011-11-21 | Paper |
| The give-up problem for blocked regional lists with multi-winners | 2011-08-04 | Paper |
| Locating median paths on connected outerplanar graphs | 2011-06-22 | Paper |
| Bicolored graph partitioning, or: gerrymandering at its worst | 2010-04-28 | Paper |
| The continuous and discrete path‐variance problems on trees | 2009-07-28 | Paper |
| Weighted Voronoi region algorithms for political districting | 2009-07-18 | Paper |
| Extensive facility location problems on networks with equity measures | 2009-06-30 | Paper |
| Comparing different metaheuristic approaches for the median path problem with bounded length | 2008-06-11 | Paper |
| Local search algorithms for political districting | 2008-04-24 | Paper |
| Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs | 2008-01-08 | Paper |
| On the complexity of general matrix scaling and entropy minimization via the RAS algorithm | 2008-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4414510 | 2003-07-25 | Paper |
| Combinatorial problems related to origin-destination matrices. | 2001-01-01 | Paper |
| Evaluation and Optimization of Electoral Systems | 1998-11-24 | Paper |
