Ponencia
Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets
Autor/es | Hartillo Hermoso, Isabel
Jiménez Cobano, J.M. Ucha Enríquez, José María |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada I (ETSII) |
Fecha de publicación | 2018 |
Fecha de depósito | 2020-02-19 |
Publicado en |
|
ISBN/ISSN | 978-3-319-99638-7 0302-9743 |
Resumen | 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 ... 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. |
Identificador del proyecto | MTM2016-75024-P
MTM2016-74983-C2- 1-R P12-FQM-2696 |
Cita | Hartillo Hermoso, I., Jiménez Cobano, J.M. y Ucha Enríquez, J.M. (2018). Finding Multiple Solutions in Nonlinear Integer Programming with Algebraic Test-Sets. En CASC 2018 : 20th International Workshop on Computer Algebra in Scientific Computing (230-237), Lille, France: Springer. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Finding Multiple Solutions in ... | 212.9Kb | [PDF] | Ver/ | |