D. Y. Gao, “Duality Principles in Nonconvex Systems: Theory, Methods and Applications,” Kluwer Academic Publishers, Dordrecht/ Boston/ London, 2000. doi:10.1007/978-1-4757-3176-7
has been cited by the following article:
TITLE: Complete Solutions to Mixed Integer Programming
AUTHORS: Ning Ruan
KEYWORDS: Duality Theory; Double Well; Global Optimization; Canonical Dual Transformation; Combinatorial Optimization; NP-hard Problems
JOURNAL NAME: American Journal of Computational Mathematics, Vol.3 No.3B, October 25, 2013
ABSTRACT: This paper considers a new canonical duality theory for solving mixed integer quadratic programming problem. It shows that this well-known NP-hard problem can be converted into concave maximization dual problems without duality gap. And the dual problems can be solved, under certain conditions, by polynomial algorithms.