Abstract
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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
