'R Gurobi Recursively Solve with Overlap Parameter K up to N Solutions

I'm using Gurobi in R to develop a solution set of size n with a maximum overlap parameter k (i.e., no solutions share more than k variables in common with another solution - the format of my solution is a bunch of binary variables indicating whether objects should be selected or not). I'm currently using PoolSearchMode = 2 and PoolSolutions = a much larger number than n so I can use a different function after solving to filter my solution set down based on overlap.

Is there a way to recursively solve one at a time, and only add solutions to my solution pool if they don't overlap more than k times with other solutions? And then stop when I get to a solution pool size of n?

rrecursionlinear-programmingoverlapgurobi


Sources

This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.

Source: Stack Overflow

Solution Source

Related Questions

recursive tree as a list (array items) in a new attribute value child

Lazy Catalan Numbers in Haskell

Why is there no tail recursion optimization in Emacs lisp, not but like other scheme?

If myStr = 'test', why does myStr[4] produce error out of range but myStr[4:] does not?

Map of sets into list of all combinations

What is wrong with my Preorder traversal?

Get full tree of parent/child relationships in mysql of any node in the tree with all parents

Given sorted Array, Returns index i if array A contains an element A[i] such that A[i] = i (recursive and divide and conquer)

Is it possible to define function that creates an N-dimensional list of lists easily?

Loop through all nested dictionary values?

Building general trees in java (with recursion)

New state of the art in unlimited generation of Hamming sequence

Writing A Recursive Function That Counts Zeros

Division using recursion

count number of digit using recursive method