The following pages link to Federica Ricca (Q226795):
Displaying 40 items.
- Algorithms for uniform centered partitions of trees (Q510918) (← links)
- A mixed integer linear program to compress transition probability matrices in Markov chain bootstrapping (Q513556) (← links)
- The give-up problem for blocked regional lists with multi-winners (Q554492) (← links)
- Political districting: From classical models to recent approaches (Q657583) (← links)
- Range minimization problems in path-facility location on trees (Q713326) (← links)
- Bidimensional allocation of seats via zero-one matrices with given line sums (Q744674) (← links)
- Comparing different metaheuristic approaches for the median path problem with bounded length (Q928015) (← links)
- (Q967424) (redirect page) (← links)
- Bicolored graph partitioning, or: gerrymandering at its worst (Q967425) (← links)
- Extensive facility location problems on networks with equity measures (Q1028434) (← links)
- Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem (Q1651649) (← links)
- Extensive facility location problems on networks: an updated review (Q1667394) (← links)
- Rejoinder on: ``Extensive facility location problems on networks: an updated review'' (Q1667396) (← links)
- Uniform and most uniform partitions of trees (Q1756346) (← links)
- Error minimization methods in biproportional apportionment (Q1939088) (← links)
- Mathematical programming formulations for practical political districting (Q1980466) (← links)
- On finding connected balanced partitions of trees (Q2028065) (← links)
- A combinatorial optimization approach to scenario filtering in portfolio selection (Q2146965) (← links)
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem (Q2217463) (← links)
- Mathematical political districting taking care of minority groups (Q2241590) (← links)
- Reliability problems in multiple path-shaped facility location on networks (Q2339811) (← links)
- Carpal tunnel syndrome automatic classification: electromyography vs. ultrasound imaging (Q2343069) (← links)
- Weighted Voronoi region algorithms for political districting (Q2389781) (← links)
- Political districting: from classical models to recent approaches (Q2393445) (← links)
- On the complexity of general matrix scaling and entropy minimization via the RAS algorithm (Q2465654) (← links)
- Local search algorithms for political districting (Q2482812) (← links)
- Unreliable point facility location problems on networks (Q2636810) (← links)
- Network flow methods for electoral systems (Q2892147) (← links)
- Locating median paths on connected outerplanar graphs (Q3008924) (← links)
- Minimax regret path location on trees (Q3100694) (← links)
- Evaluation and Optimization of Electoral Systems (Q4220552) (← links)
- (Q4414510) (← links)
- Partitioning a graph into connected components with fixed centers and optimizing cost‐based objective functions or equipartition criteria (Q4638584) (← links)
- The continuous and discrete path‐variance problems on trees (Q5191143) (← links)
- Polynomial algorithms for partitioning a tree into single‐center subtrees to minimize flat service costs (Q5433194) (← links)
- Combinatorial problems related to origin-destination matrices. (Q5954235) (← links)
- A Multicriteria Districting Heuristic For The Aggregation Of Zones And Its Use In Computing Origin-Destination Matrices (Q6039357) (← links)
- Portfolio optimization through a network approach: network assortative mixing and portfolio diversification (Q6090171) (← links)
- Connected graph partitioning with aggregated and non‐aggregated gap objective functions (Q6180037) (← links)
- A combinatorial optimization approach to scenario filtering in portfolio selection (Q6361842) (← links)
