A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap

Tingsong Du, Jingli Yang. A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap. In Sixth International Conference on Natural Computation, ICNC 2010, Yantai, Shandong, China, 10-12 August 2010. pages 3098-3101, IEEE, 2010. [doi]

Abstract

Abstract is missing.