Approximating quadratic programming with bound and quadratic constraints

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Michel X. Goemans, David P. Williamson · Journal of the ACM · 1995 · 3.7K citations · Full text

Computing, Computer Science, Algorithms +14

Improved approximation algorithms for MAXk-CUT and MAX BISECTION

Alan Frieze, M. Jerrum · Algorithmica · 1997 · 412 citations

Computing, Computer Science, Algorithms +10

Nonlinear Optimization: Complexity Issues.

Pãnos M. Pardalos, Stephen A. Vavasis · Mathematics of Computation · 1993 · 344 citations

Natural Sciences, Computer Science, Algorithms +15

A recipe for semidefinite relaxation for (0,1)-quadratic programming

S. Poljak, Franz Rendl, Henry Wolkowicz · Journal of Global Optimization · 1995 · 199 citations

Natural Sciences, Computer Science, Mathematics +13

The complexity of approximating a nonlinear program

Mihir Bellare, Phillip Rogaway · Mathematical Programming · 1995 · 130 citations

Computing, Computer Science, Mathematics +11