Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience

Authors:
Riccardo Cambini;Francesca Salvi
Affiliations:
-;-
Venue:
Operations Research Letters
Year:
2010

Citing 7
Cited 0

DC programming: overview

Journal of Optimization Theory and Applications
On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems

SIAM Journal on Optimization
A Finite Algorithm for Global Minimization ofSeparable Concave Programs

Journal of Global Optimization
Portfolio optimization under D.C. transaction costs and minimal transaction unit constraints

Journal of Global Optimization
Global Optimization of Multiplicative Programs

Journal of Global Optimization
Decomposition Methods for Solving Nonconvex Quadratic Programs via Branch and Bound*

Journal of Global Optimization
Decomposition branch and bound method for globally solving linearly constrained indefinite quadratic minimization problems

Operations Research Letters

Quantified Score

Hi-index	0.00

Visualization

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.