Concepedia

Non-convex mixed-integer nonlinear programming: A survey

Samuel Burer, Adam N. Letchford

Surveys in Operations Research and Management Science · 2012 · 552 citations · 130 references

DOI

Concepts

References

130

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

, , +14

Global Optimization with Polynomials and the Problem of Moments

Jean B. Lasserre · SIAM Journal on Optimization · 2001 · 2.6K citations

, , +10

Generalized Benders decomposition

Arthur M. Geoffrion · Journal of Optimization Theory and Applications · 1972 · 2.5K citations

Computability of global solutions to factorable nonconvex programs: Part I — Convex underestimating problems

Garth P. McCormick · Mathematical Programming · 1976 · 2.3K citations

, , +10

An Automatic Method of Solving Discrete Programming Problems

A. H. Land, A. G. Doig · Econometrica · 1960 · 1.9K citations

, , +9