Chess and solution pool with linear programming (2018)

More specifically, using mixed integer linear programming.<p>I&#x27;ve never seen an MILP used this way, to characterize the entire feasible set (or &quot;solution pool&quot;). Is this one of the fastest ways to do so? The usual branch-and-bound type methods won&#x27;t apply, since the solver has to enumerate every feasible solution.<p>The CPLEX docs (<a href="https:&#x2F;&#x2F;www.ibm.com&#x2F;docs&#x2F;en&#x2F;icos&#x2F;22.1.1?topic=solutions-how-enumerate-all" rel="nofollow noreferrer">https:&#x2F;&#x2F;www.ibm.com&#x2F;docs&#x2F;en&#x2F;icos&#x2F;22.1.1?topic=solutions-how-...</a>) mention the potential slowness and also the numerical issues the author faces in the article.