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]
@inproceedings{DuY10-0,
title = {A Branch and Bound algorithm for solving nonconvex minimization problem based on reducing duality gap},
author = {Tingsong Du and Jingli Yang},
year = {2010},
doi = {10.1109/ICNC.2010.5584651},
url = {http://dx.doi.org/10.1109/ICNC.2010.5584651},
tags = {rule-based},
researchr = {https://researchr.org/publication/DuY10-0},
cites = {0},
citedby = {0},
pages = {3098-3101},
booktitle = {Sixth International Conference on Natural Computation, ICNC 2010, Yantai, Shandong, China, 10-12 August 2010},
publisher = {IEEE},
isbn = {978-1-4244-5961-2},
}