S. Leyffer, “Integrating SQP and Branch-and-bound for Mixed Integer Nonlinear Programming,” Computational Optimization and Applications, Vol. 18, No. 3, 2001, pp. 295-309. doi:10.1023/A:1011241421041

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.