Skip to main content

and
  1. No Access

    Article

    Maximally diverse grou**: an iterated tabu search approach

    The maximally diverse grou** problem (MDGP) consists of finding a partition of a set of elements into a given number of mutually disjoint groups, while respecting the requirements of group size constraints a...

    Gintaras Palubeckis, Armantas Ostreika in Journal of the Operational Research Society (2015)