In this work, we propose a strategy for computing valid lower bounds for a specific class of integer nonlinear programming problems, that includes integer quadratic programming problems. This strategy is used within a branch-and-bound scheme. Experimental results for randomly generated instances show that, in the quadratic case, the devised branch-and-bound method compares favorably to the MIQP solver of CPLEX 12.6 when the number of constraints is small. © 2016 Elsevier B.V.
Dual approaches for a specific class of integer nonlinear programming problems / DE SANTIS, Marianna. - In: ELECTRONIC NOTES IN DISCRETE MATHEMATICS. - ISSN 1571-0653. - 55:(2016), pp. 73-76. [10.1016/j.endm.2016.10.019]
Dual approaches for a specific class of integer nonlinear programming problems
DE SANTIS, MARIANNA
2016
Abstract
In this work, we propose a strategy for computing valid lower bounds for a specific class of integer nonlinear programming problems, that includes integer quadratic programming problems. This strategy is used within a branch-and-bound scheme. Experimental results for randomly generated instances show that, in the quadratic case, the devised branch-and-bound method compares favorably to the MIQP solver of CPLEX 12.6 when the number of constraints is small. © 2016 Elsevier B.V.| File | Dimensione | Formato | |
|---|---|---|---|
|
DeSantis_Dual-approaches_2016.pdf
solo gestori archivio
Tipologia:
Versione editoriale (versione pubblicata con il layout dell'editore)
Licenza:
Tutti i diritti riservati (All rights reserved)
Dimensione
179.82 kB
Formato
Adobe PDF
|
179.82 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
