How to select a small set of diverse solutions to mixed integer programming problems

Given an oracle that generates a large number of solutions to mixed integer programs, we present exact and heuristic approaches to select a small subset of solutions that maximizes solution diversity. We obtain good results on binary variables, but report scaling problems when considering general integer and continuous variables.