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 bound approach for solving a class of d.c. problems. Both stack policies and partitioning rules are analyzed, pointing out their performance effectiveness by means of the results of a computational experience. (C) 2010 Elsevier B.V. All rights reserved.
|Autori:||Cambini, Riccardo; Salvi, F.|
|Titolo:||Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience|
|Anno del prodotto:||2010|
|Digital Object Identifier (DOI):||10.1016/j.orl.2010.07.008|
|Appare nelle tipologie:||1.1 Articolo in rivista|