A branch and reduce approach for solving a class of low rank d.c. programs

https://doi.org/10.1016/j.cam.2009.07.053Get rights and content
Under an Elsevier user license
open archive

Abstract

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.

MSC

90C30
90C26

Keywords

d.c. programming
Branch and reduce

Cited by (0)