Various classes of d.c. programs have been studied in the recent literature due to their importance in applicative problems. In this paper we consider a branch and reduce approach for solving a class of d.c. problems. Seven partitioning rules are analyzed and some techniques aimed at improving the overall performance of the algorithm are proposed. The results of a computational experience are provided in order to point Out the performance effectiveness of the proposed techniques. (C) 2009 Elsevier B.V. All rights reserved.
|Autori:||Cambini R; Salvi F|
|Titolo:||A branch and reduce approach for solving a class of low rank d.c. programs|
|Anno del prodotto:||2009|
|Digital Object Identifier (DOI):||10.1016/j.cam.2009.07.053|
|Appare nelle tipologie:||1.1 Articolo in rivista|