“…for instance considered two types of diversity constraints, namely the interval constraints and dominance constraints, 3 and studied the problem of selecting a feasible committee that preserves the excellence of candidates under an objective function. Ianovski (2022) then focused on the computational complexity of this problem. A second example concerns the work of Aziz (2019) who considered that the set of candidates is structured into several non-disjoint classes according to a specific attribute, and defined a diversity constraint as a vector of integers specifying the lowest number of candidates to be selected from each class.…”