The maximum dispersion problem

► We analyse a partitioning problem where groups have to be as diverse as possible. ► We present different applications of the abstract problem. ► We propose different linear programming formulations and an exact solution scheme. ► We derive tight upper and lower bounds that considerably improve the formulations. ► The solvable problem sizes are increased by more than one order of magnitude.