首页 | 本学科首页   官方微博 | 高级检索  
     


A branch and reduce approach for solving a class of low rank d.c. programs
Authors:Riccardo Cambini  Francesca Salvi  
Affiliation:aDepartment 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 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.
Keywords:d.c. programming   Branch and reduce
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号