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

Operations Research Letters（2009）

引用 37|浏览0

暂无评分

摘要

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.

查看译文

关键词

maximizes solution diversity,diverse solution,mixed integer program,small set,multiple solutions,continuous variable,general integer,heuristic approach,binary variable,integer programming,mixed integer programming problem,mip,solution diversity,solution variety,large number,small subset,good result

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要