Article
Finding multiplies solutions for non-linear integer programming
Author/s | Jiménez Cobano, José Manuel
Ucha Enríquez, José María ![]() ![]() ![]() ![]() ![]() ![]() ![]() |
Publication Date | 2018 |
Deposit Date | 2020-02-25 |
Published in |
|
Abstract | We explain how to compute all the solutions of a nonlinear integer problem using the algebraic test-sets associated to some linear subproblem. These test-sets are obtained using Gr¨obner bases. We compare our method with previous approaches |
Project ID. | MTM2016-75024-P
![]() MTM2016-74983-C2-1-R ![]() P12-FQM-2696 ![]() FQM-333 ![]() |
Citation | Jiménez Cobano, J.M. y Ucha Enríquez, J.M. (2018). Finding multiplies solutions for non-linear integer programming. Electronic Notes in Discrete Mathematics, 68, 125-130. |
Files | Size | Format | View | Description |
---|---|---|---|---|
Finding multiplies solutions for ... | 175.9Kb | ![]() | View/ | |