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.Ministerio de Economía y Competitividad MTM2016-75024-PMinisterio de Economía y Competitividad MTM2016-74983-C2- 1-RJunta de Andalucía P12-FQM-269
AbstractAn exact method for solving all-integer non-linear programming problems with a separable non...
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such...
AbstractMultiobjective discrete programming is a well-known family of optimization problems with a l...
We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test...
Many problems in engineering design involve the use of nonlinearities and some integer variables. M...
This paper presents a new methodology for solving multiobjective integer linear programs (MOILP) usi...
AbstractMultiobjective discrete programming is a well-known family of optimization problems with a l...
Abstract. Many problems in engineering design involve the use of nonlin-earities and some integer va...
Integer nonlinear optimization programs form a class of very hard problems. Often it is much easier ...
AbstractWe show how Dickson's lemma yields an algorithm for computing the general N-solution to a li...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
AbstractAn exact method for solving all-integer non-linear programming problems with a separable non...
The redundancy allocation problem is formulated minimizing the design cost for a series-parallel sys...
The special nonlinear mathematical programming problem which isaddressed in this paper has a structu...
AbstractAn exact method for solving all-integer non-linear programming problems with a separable non...
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such...
AbstractMultiobjective discrete programming is a well-known family of optimization problems with a l...
We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test...
Many problems in engineering design involve the use of nonlinearities and some integer variables. M...
This paper presents a new methodology for solving multiobjective integer linear programs (MOILP) usi...
AbstractMultiobjective discrete programming is a well-known family of optimization problems with a l...
Abstract. Many problems in engineering design involve the use of nonlin-earities and some integer va...
Integer nonlinear optimization programs form a class of very hard problems. Often it is much easier ...
AbstractWe show how Dickson's lemma yields an algorithm for computing the general N-solution to a li...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
This paper studies the Graver's optimality conditions for multi-objective non-linear integer program...
AbstractAn exact method for solving all-integer non-linear programming problems with a separable non...
The redundancy allocation problem is formulated minimizing the design cost for a series-parallel sys...
The special nonlinear mathematical programming problem which isaddressed in this paper has a structu...
AbstractAn exact method for solving all-integer non-linear programming problems with a separable non...
The class of POP (Polynomial Optimization Problems) covers a wide rang of optimization problems such...
AbstractMultiobjective discrete programming is a well-known family of optimization problems with a l...