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 Gröbner bases. The main advantage of this method, compared to other available alternatives, is its exactness within a quite good efficiency.
- 1.Sahinidis, N. V.: BARON 14.4.0: Global Optimization of Mixed-Integer Nonlinear Programs. User’s Manual (2014)Google Scholar
- 6.Belotti, P.: COUENNE: a user’s manual. Department of Mathematics Sciences, Clemson University. https://www.coin-or.org/Couenne/
- 9.4ti2 team: 4ti2 - a software package for algebraic, geometric and combinatorial problems on linear spaces (2013). https://www.4ti2.de
- 12.Markowitz, H.: Portfolio selection. J. Finance 7, 77–91 (1952)Google Scholar