Minimal subsolution only on single full solution.

Bugme Not

• December 10, 2020 18:26

I want to get a minimal partly solution only when it is proved it has a solution.
An easy example this matrix:
a xor b xor c
d xor e xor f
g xor h xor i

a xor d xor g
b xor e xor h
c xor f xor i

One possible solution is AE while full solution will be AEI and no other solution is possible.
My real problem is larger and solutions could be smaller than n-1. Something like queens puzzle.
For configuration if possible I want subsize <= n or subsize = n.
I have tried in 9.0.0 something but it cannot prove it only has a single solution.
Also looked at some examples but did not see something like this.
How to get this working in Gurobi?

0

• Official comment

  

  Simranjit Kaur

  Gurobi Staff

  • December 06, 2024 00:38

  This post is more than three years old. Some information may not be up to date. For current information, please check the Gurobi Documentation or Knowledge Base. If you need more help, please create a new post in the community forum. Or why not try our AI Gurobot?.

Post is closed for comments.