Semidefinite Programming and Integer Programming

Semidefinite Programming and Integer Programming

Cached

Download Links

[homepages.cwi.nl]
[www.cwi.nl]
[homepages.cwi.nl]

Other Repositories/Bibliography

DBLP

by Monique Laurent , Franz Rendl

Citations:

31 - 6 self

BibTeX

@MISC{Laurent_semidefiniteprogramming,
    author = {Monique Laurent and Franz Rendl},
    title = {Semidefinite Programming and Integer Programming},
    year = {}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

We survey how semidefinite programming can be used for finding good approximative solutions to hard combinatorial optimization problems.

Citations

773	Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming - Goemans, Williamson - 1995
422	Interior-point methods in semidefinite programming with applications to combinatorial optimization - Alizadeh - 1995
317	Some simplified NP-complete graph problems, Theoret - Garey, Johnson, et al. - 1976
294	Algebraic connectivity of graphs - Fiedler - 1973
243	On Lipschitz embedding of finite metric spaces in Hilbert space - Bourgain - 1985
208	M.: Geometry of cuts and metrics - Deza, Laurent - 1997
194	M.Szegedy. Proof verification and intractability of approximation problems - Arora, Lund, et al. - 1998
192	An Algebraic Approach to the Association Schemes of Coding Theory - Delsarte - 1973
177	A lift-and-project cutting plane algorithm for mixed 0-1 programs - Balas, Ceria, et al. - 1993
177	On the combinatorial and algebraic complexity of quantifier elimination - Basu, Pollack, et al. - 1996
153	Polynomial time approximation schemes for dense instances of NP-hard problems - Arora, Karger, et al. - 1995
149	Distance Geometry and Molecular Conformation. Research Studies - Crippen, Havel - 1988
143	Improved Approximation Algorithms for MAX k-CUT - Frieze, Jerrum - 1997
136	Géométrie algébrique réelle - Bochnak, Coste, et al. - 1987
125	Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT - Feige, Goemans - 1995
123	Edmonds polytopes and a hierarchy of combinatorial problems - Chvátal - 1973
104	On the computational complexity of Ising spin glass models - Barahona - 1982
96	On the cut polytope - Barahona, Mahjoub - 1986
85	On certain polytopes associated with graphs - Chvátal - 1975
85	Semidefinite programming and combinatorial optimization - Goemans - 1998
83	Disjunctive programming - Balas - 1979
71	On the importance of being biased - Dinur, Safra - 2002
64	New 3/4-approximation algorithms for the maximum satisfiability problem - Goemans, Williamson - 1994
55	H.: Solving Euclidean distance matrix completion problems via semidefinite programming - Alfakih, Khandani, et al. - 1999
54	Solving large quadratic assignment problems on computational grids, preprint - Anstreicher, Brixius, et al. - 2000
54	Positive definite completions of partial Hermitian matrices - Grone, Johnson, et al. - 1984
52	The complexity of approximating a nonlinear program - BELLARE, ROGOW, et al. - 1993
48	Laplacian eigenvalues and the maximum cut problem - Delorme, Poljak - 1990
48	A new lower bound via projection for the quadratic assignment problem, preprint - Hadley, Rendl, et al. - 1991
47	Proving integrality gaps without knowing the linear program - Arora, Bollobas, et al. - 2002
44	The Quadratic Assignment Problem: Theory and Algorithms - ÇELA - 1998
43	Chvátal closures for mixed integer programming problems - Cook, Kannan, et al. - 1990
39	Forbidden intersections - Frankl, Rödl - 1987
37	On lagrangian relaxations of quadratic matrix constraints - Anstreicher, Wolkowicz
37	Randomized graph products, chromatic numbers, and the Lov'asz #-function - Feige - 1995
37	On the optimality of the random hyperplane rounding technique for max cut - Feige, Schechtman
37	An Õ(n3/14 )-coloring algorithm for 3-colorable graphs - Blum, Karger - 1997
35	New approximation algorithms for graph coloring - Blum - 1994
33	Approximating the independence number via the `-function - Alon, Kahale - 1994
31	Problems of distance geometry and convex properties of quadratic maps - Barvinok - 1995
31	Improved approximation algorithms for MAX SAT - Asano, Williamson - 2002
29	Semidefinite programming relaxation for nonconvex quadratic programs - FUJIE, KOJIMA - 1997
27	Feasibility testing for systems of real quadratic equations,” Discrete Comput. Geom. 10 - Barvinok - 1993
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
23	Anti-blocking polyhedra - Fulkerson - 1972
22	Bipartite subgraphs and the smallest eigenvalue - Alon, Sudakov
22	Weakly bipartite graphs and the max-cut problem - Grotschel, Pulleyblank - 1981
22	The probable value of the lovász–schrijver relaxations for maximum independent set - Feige, Krauthgamer