Solving a class of low rank d.c. programs via a branch and bound approach: A computational experience |
| |
| Authors: | Riccardo Cambini Francesca Salvi |
| |
| Institution: | Department of Statistics and Applied Mathematics, Faculty of Economics, University of Pisa, Via Cosimo Ridolfi 10, 56124 Pisa, Italy |
| |
| 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. |
| |
| Keywords: | d c programmings Nonconvex programming Branch and bound |
| 本文献已被 ScienceDirect 等数据库收录！ |
