A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming

A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming (2001)

Cached

Download Links

by M. Laurent

Venue:	Mathematics of Operations Research
Citations:	61 - 9 self

BibTeX

@ARTICLE{Laurent01acomparison,
    author = {M. Laurent},
    title = {A comparison of the Sherali-Adams, Lovász-Schrijver and Lasserre relaxations for 0-1 programming},
    journal = {Mathematics of Operations Research},
    year = {2001},
    volume = {28},
    pages = {470--496}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
281	On the Shannon capacity of a graph - Lovász
220	Global optimization with polynomials and the problem of moments - Lasserre - 2001
211	Cones of matrices and set-functions and 0 , 1 optimization - Lovasz, Schrijver - 1991
208	M.: Geometry of cuts and metrics - Deza, Laurent - 1997
177	A lift-and-project cutting plane algorithm for mixed 0-1 programs - Balas, Ceria, et al. - 1993
137	A hierarchy of relaxations between the continuous and convex hull representations for zero-one programming problems - Sherali, Adams - 1990
125	Structured semidefinite programs and semialgebraic geometry methods - Parrilo
123	Edmonds polytopes and a hierarchy of combinatorial problems - Chvátal - 1973
111	Positive polynomials on compact semi-algebraic sets - Putinar - 1993
97	The K-moment problem for compact semi-algebraic sets - Schmüdgen - 1991
96	On the cut polytope - Barahona, Mahjoub - 1986
79	Harmonic Analysis on Semigroups: Theory of Positive Definite and Related Functions - Berg, Christensen, et al. - 1984
72	Some concrete aspects of Hilbert’s 17th problem, volume 253 of Contemporary Mathematics - Reznick - 2000
71	Squared functional systems and optimization problems - Nesterov - 2000
66	A reformulation-linearization technique for solving discrete and continuous nonconvex problems, Kluwer Book Series: Nonconvex Optimization and its Applications - Sherali, Adams - 1999
50	An explicit exact SDP relaxation for nonlinear 0-1 programs - Lasserre
37	The truncated complex K-moment problem - Curto, Fialkow
29	Semidefinite programming relaxation for nonconvex quadratic programs - FUJIE, KOJIMA - 1997
29	Tuncbilek, A global optimization algorithm for polynomial programming problems using a reformulation-linearization technique - Sherali, H - 1992
28	The multidimensional moment problem - Fuglede - 1983
28	Approximating of the stability number of a graph via copositive programming - Klerk, Pasechnik, et al.
28	Nondifferentiable optimization and polynomial problems - Shor - 1998
28	A hierarchy of relaxations and convex hull characterizations for mixed-integer zero-one programming problems - Sherali, Adams - 1994
27	When does the positive semidefiniteness constraint help in lifting procedures - Goemans, Tunçel - 2001
25	On cutting-plane proofs in combinatorial optimization. Linear Algebra and its Applications - CHVÁTAL, COOK, et al. - 1989
25	On the matrix-cut rank of polyhedra - Cook, Dash - 2001
21	Bounds on the Chvátal rank of polytopes in the 0/1 cube - Eisenbrand, Schulz
20	On the membership problem for the elementary closure of a polyhedron - Eisenbrand
20	TUNÇEL: On a representation of the matching polytope via semidefinite liftings - STEPHEN, L - 1999
19	Strengthened semidefinite relaxations via a second lifting for the max-cut problem - Anjos, Wolkowicz
16	Representing polynomials by positive linear functions on compact convex polyhedra - Handelman - 1988
12	Exploiting special structures in constructing a hierarchy of relaxations for 0 − 1 mixed integer problems - Sherali, Adams, et al. - 1998
11	A remark on the multidimensional moment problem - Berg, Christensen, et al.
11	Hadamard determinants, Möbius functions, and the chromatic number of a graph - Wilf - 1968
10	Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization - Parillo - 2000
9	On the rank of mixed 0 − 1 polyhedra - Cornuéjols, Li
9	On the momentum problem for distributions in more than one dimension - Haviland - 1936
9	Optimality conditions and LMI relaxations for 0-1 programs - Lasserre - 2000
8	Semidefinite programming vs. LP relaxations for polynomial programming - Lasserre
7	Tighter linear and semidefinite relaxations for max-cut based on the Lovász-Schrijver lift-andproject procedure - Laurent
7	Tuncbilek, New reformulation-linearization/convexification relaxations for univariate and multivariate polynomial programming problems - Sherali, H - 1997
5	An approach to obtaining global extremums in polynomial mathematical programming problems - Shor - 1987
1	On the momentum problem for distributions in more than one dimension - K - 1936
1	Semidefinite relaxations for Max-Cut. To appear - Laurent