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

Authors:
Emilie Danna;David L. Woodruff
Affiliations:
IBM, United States;Graduate School of Management, UC Davis, United States
Venue:
Operations Research Letters
Year:
2009

Citing 7
Cited 1

Measurement of Population Diversity

Selected Papers from the 5th European Conference on Artificial Evolution
A distance function to support optimized selection decisions

Decision Support Systems
Optimizing over the first Chvátal closure

Mathematical Programming: Series A and B
Optimizing over the split closure

Mathematical Programming: Series A and B
Generating Multiple Solutions for Mixed Integer Programming Problems

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Experiments concerning sequential versus simultaneous maximization of objective function and distance

Journal of Heuristics
Disjunctive cuts for non-convex mixed integer quadratically constrained programs

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization

A MIP-based framework and its application on a lot sizing problem with setup carryover

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

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.