The balanced maximally diverse grouping problem with attribute values (BMDGPAV) is a variant of the well-known maximally diverse grouping problem (MDGP) which assigns items to groups such that the sum of absolute differences of all item pairs assigned to the same group is maximized. In the BMDGPAV absolute differences are absolute differences of the attribute values of the corresponding items. This is a realistic setting for example in the assignment of students to courses according to their academic achievements. Moreover, BMDGPAV searches for a best-balanced solution amongst all solutions with maximal sum of intra-group differences (i.e. optimal solutions of the corresponding MDGP instance). We present theoretical insights as well as solution approaches and a computational study for the BMDGPAV.
Keywords: Computational Complexity, Mixed-Integer ProgrammingScheduled
FB2 Heuristics 2
June 11, 2021 10:45 AM
2 - LV Kantorovich