Article citationsMore>>

P. Kesavan, R. J. Allgor, E. P. Gatzke and P. I. Barton, “Outer Approximation Algorithms for Separable Nonconvex Mixed-integer Nonlinear Programs,” Mathematical Programming, Vol. 1000, No. 3, 2004, pp. 517-535.

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.