Dual approaches for a specific class of integer nonlinear programming problems

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 sho...

Full description

Saved in:
Bibliographic Details
Published inElectronic notes in discrete mathematics Vol. 55; pp. 73 - 76
Main Author De Santis, Marianna
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.11.2016
Subjects
global optimization
integer programming
quadratic programming
integer programming
quadratic programming
global optimization
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:1571-0653
1571-0653
DOI:10.1016/j.endm.2016.10.019