Article ID Journal Published Year Pages File Type
1143113 Operations Research Letters 2009 6 Pages PDF
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.
Keywords
Related Topics
Physical Sciences and Engineering Mathematics Discrete Mathematics and Combinatorics
Preview
How to select a small set of diverse solutions to mixed integer programming problems
Authors
, ,