Skip to main content

Recursively Solving for N Solutions in Pool with Overlap Parameter

Ongoing

Comments

2 comments

  • Jaromił Najman
    • Gurobi Staff Gurobi Staff

    Hi Kat,

    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? 

    It is possible. However, it requires quite some work, because you have to make sure that previous solutions are excluded from the feasible space. This would most likely result is some form of B&B algorithm. I think that is it way more convenient to use your approach, i.e., use PoolSearchMode and PoolSolutions to generate many solution point and then check those for overlapping.

    I am not familiar with R so unfortunately I cannot really help with a pseudo code.

    Best regards, 
    Jaromił

    0
  • Kat K
    • Gurobi-versary
    • First Comment
    • First Question

    Hi Jaromił,

    Thanks for the reply. Unfortunately I'm finding my run time is extremely long if I keep PoolSearchMode and PoolSolutions - I've seen a similar question where the person recursively re-solved with additional constraints here:

    https://support.gurobi.com/hc/en-us/community/posts/360043374531-Solve-time-issues-with-solution-overlap-parameter

    This is what I'm trying to accomplish, but don't know how to set that up. Thanks!

    0

Please sign in to leave a comment.