Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1142543 | Operations Research Letters | 2010 | 4 Pages |
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 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Riccardo Cambini, Francesca Salvi,