| 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 |
Cardinality constrained connected balanced partitions of trees under different criteria
Discrete Optimization | 2023-02-16 | Paper |
A combinatorial optimization approach to scenario filtering in portfolio selection
Computers \& Operations Research | 2022-06-22 | 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
| 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 |
An optimization-diversification approach to portfolio selection
Journal of Global Optimization | 2020-02-28 | Paper |
Clustering and portfolio selection problems: a unified framework
Computers \& Operations Research | 2020-02-20 | Paper |
Total distance, Wiener index and opportunity index in wreath products of star graphs
The Electronic Journal of Combinatorics | 2019-03-05 | 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 |
Alternating current optimal power flow with generator selection
| 2018-08-17 | Paper |
Mathematical programming formulations for the efficient solution of the \(k\)-sum approval voting problem
Computers \& Operations Research | 2018-07-12 | Paper |
Ordered weighted average optimization in multiobjective spanning tree problem
European Journal of Operational Research | 2018-05-29 | Paper |
On exact and approximate stochastic dominance strategies for portfolio selection
European Journal of Operational Research | 2018-05-25 | Paper |
Complexity of some graph-based bounds on the probability of a union of events
Discrete Applied Mathematics | 2018-05-24 | 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 |
A linear risk-return model for enhanced indexation in portfolio optimization
OR Spectrum | 2015-08-03 | Paper |
Linear vs. quadratic portfolio selection models with hard real-world constraints
Computational Management Science | 2015-07-24 | Paper |
Polynomially computable bounds for the probability of the union of events
Mathematics of Operations Research | 2015-04-24 | 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 |
A new method for mean-variance portfolio optimization with cardinality constraints
Annals of Operations Research | 2013-08-07 | Paper |
Exact and heuristic approaches for the index tracking problem with UCITS constraints
Annals of Operations Research | 2013-08-07 | 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 |
On the complexity of some subgraph problems
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 |
Co-Evolutive Models for Firms Dynamics
Lecture Notes in Economics and Mathematical Systems | 2009-02-26 | Paper |
A clique algorithm for standard quadratic programming
Discrete Applied Mathematics | 2008-11-19 | Paper |
Comparing different metaheuristic approaches for the median path problem with bounded length
European Journal of Operational Research | 2008-06-11 | Paper |
The location of median paths on grid graphs
Annals of Operations Research | 2008-03-31 | Paper |
Algorithms for central-median paths with bounded length on trees
European Journal of Operational Research | 2007-02-12 | Paper |
On finding dissimilar Pareto-optimal paths
European Journal of Operational Research | 2005-02-09 | Paper |
scientific article; zbMATH DE number 2081036 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 1953106 (Why is no real title available?)
| 2003-07-25 | Paper |
Efficient algorithms for finding the (k,l)-core of tree networks
Networks | 2003-03-19 | Paper |
scientific article; zbMATH DE number 1846765 (Why is no real title available?)
| 2002-12-17 | Paper |
Finding the \(\ell\)-core of a tree
Discrete Applied Mathematics | 2002-05-15 | Paper |
