Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets

摘要

We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test-sets associated to a suitable linear subproblem. These test-sets are obtained using Grobner bases. The main advantage of this method, compared to other available alternatives, is its exactness within a quite good efficiency.