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