A reformulation-convexification approach for solving nonconvex quadratic programming problems

The Lagrangian Relaxation Method for Solving Integer Programming Problems

Marshall L. Fisher · Management Science · 1981 · 2.1K citations

Mathematical Programming, Numerical Analysis, Branch-and-bound Algorithm +19

Jointly Constrained Biconvex Programming

Faiz Al-Khayyal, James E. Falk · Mathematics of Operations Research · 1983 · 541 citations

Mathematical Programming, Computational Science, Engineering +14

Quadratic programming with one negative eigenvalue is NP-hard

Pãnos M. Pardalos, Stephen A. Vavasis · Journal of Global Optimization · 1991 · 504 citations

Mathematical Programming, Engineering, Semi-definite Optimization +4

Lagrangean decomposition: A model yielding stronger lagrangean bounds

Monique Guignard, Siwhan Kim · Mathematical Programming · 1987 · 423 citations

Mathematical Programming, Engineering, Convex Optimization +5

A new reformulation-linearization technique for bilinear programming problems

Hanif D. Sherali, Amine Alameddine · Journal of Global Optimization · 1992 · 383 citations

Mathematical Programming, Numerical Analysis, New Reformulation-linearization Technique +5