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

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

0.00 Avg rating0 Votes
Article ID: iaor20102971
Volume: 37
Issue: 4
Start Page Number: 255
End Page Number: 260
Publication Date: Jul 2009
Journal: Operations Research Letters
Authors: ,
Keywords: heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.