The aim of this paper is to discuss different branch and bound methods for solving indefinite quadratic programs. In these methods the quadratic objective function is decomposed in a d.c. form and the relaxations are obtained by linearizing the concave part of the decomposition. In this light, various decomposition schemes have been considered and studied. The various branch and bound solution methods have been implemented and compared by means of a deep computational test.
|Autori:||Cambini R; Sodini C|
|Titolo:||A computational comparison of some branch and bound methods for indefinite quadratic programs|
|Anno del prodotto:||2008|
|Digital Object Identifier (DOI):||10.1007/s10100-007-0049-4|
|Appare nelle tipologie:||1.1 Articolo in rivista|