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


A branch-and-cut algorithm using polar cuts for solving nonconvex quadratic programming problems
Authors:Zhibin Deng  Shu-Cherng Fang  Cheng Lu
Institution:1. School of Economics and Management, University of Chinese Academy of Sciences, Beijing, China.;2. Key Laboratory of Big Data Mining and Knowledge Management, Chinese Academy of Sciences, Beijing, China.;3. Department of Industrial and Systems Engineering, North Carolina State University, Raleigh, NC, USA.;4. School of Economics and Management, North China Electric Power University, Beijing, China.
Abstract:
Keywords:Branch-and-cut algorithm  nonconvex quadratically constrained quadratic programming  polar cut  semidefinite relaxation
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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