Una variante del problema de la diversidad máxima para seleccionar equipos de trabajo eficientes
Keywords:
Maximum Diversity Problem, Binary nonlinear programmingAbstract
The maximum diversity problem consists in selecting a subset of elements from a given set in such a way that a measure of diversity is maximized. In particular, we target the Max-Mean model in which the average distance between the selected elements is maximized. We first review previous methods and mathematical formulations for this and related dispersion problems and then propose analytic properties for them. Our model is especially suited for instances in which the“distances”represent affinity and are not restricted to take non-negative values. In this paper, we solvinga real instance, to obtain a diverse assembly of professors from the ESPOL University at Guayaquil (Ecuador). For each professor, we record 7 attributes (tenure position, gender, academic degree, research level, background, salary level, and department),and the similarity measure between each pair of them is computed.
