Maximizing single attribute diversity in group selection
From MaRDI portal
Publication:2678607
DOI10.1007/s10479-022-04764-7OpenAlexW4281567663MaRDI QIDQ2678607
Isabelle Chalamon, Fabio J. Petani, Sergey Kovalev
Publication date: 23 January 2023
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-022-04764-7
Cites Work
- Unnamed Item
- Construction and improvement algorithms for dispersion problems
- Performance analysis of non-banking finance companies using two-stage data envelopment analysis
- A study on two geometric location problems
- Time bounds for selection
- Effective methods for solving the bi-criteria \(p\)-center and \(p\)-dispersion problem
- Distant diversity in dynamic class prediction
- An exact algorithm for designing optimal districts in the collection of waste electric and electronic equipment through an improved reformulation
- Solving the maximum min-sum dispersion by alternating formulations of two different problems
- Electing a committee with dominance constraints
- Maximum diversity problem with squared Euclidean distance
- Managing portfolio diversity within the mean variance theory
- A branch and bound algorithm for the maximum diversity problem
- On the unified dispersion problem: efficient formulations and exact algorithms
- Max-sum diversity via convex programming
- Finding k points with minimum diameter and related problems
- Heuristic and Special Case Algorithms for Dispersion Problems
This page was built for publication: Maximizing single attribute diversity in group selection
