Monique Laurent, Svatopluk Poljak, Franz Rendl  Home/Search
Context Related
| orion.math.uwaterloo.ca/~hw...mp5.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: orion.math.uwaterloo.ca/~...svata (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe the links existing between a recently introduced semidefinite relaxation for the max-cut problem and the well known semidefinite relaxation for the stable set problem underlying the Lov'asz's theta function. It turns out that the connection between the convex bodies defining the semidefinite relaxations mimics the connection existing between the corresponding polyhedra. We also show how the semidefinite relaxations can be combined with the classical linear relaxations in order to... (Update)
Cited by: More
Unknown - Strengthenedsemidefiniteprogramming.. (Correct)
Semidefinite Programming Relaxation for the Independent Set.. - van Hoeve (1999) (Correct)
Exploiting Semidefinite Relaxations in Constraint Programming - van Hoeve (2003) (Correct)
Active bibliography (related documents): More All
0.6: Combining Semidefinite and Polyhedral Relaxations.. - Helmberg, Poljak.. (1995) (Correct)
0.5: A Recipe for Semidefinite Relaxation for (0,1)-Quadratic.. - Poljak, Rendl, Wolkowicz (1992) (Correct)
0.5: Polyhedral Techniques in Combinatorial Optimization I: Theory - Aardal, van Hoesel (1995) (Correct)
Similar documents based on text: More All
0.8: A Hybrid Constraint Programming and Semidefinite Programming.. - van Hoeve (2003) (Correct)
0.7: Semidefinite Programming and Integer Programming - Laurent, Rendl (Correct)
0.5: Space-efficient Approximation Algorithms for MAXCUT and COLORING .. - Klein, Lu (1996) (Correct)
Related documents from co-citation: More All
19: An interior-- point method for semidefinite programming - Helmberg, Rendl et al. - 1996
16: Improved approximation algorithms for maximum cut and satisfiability problems us.. - GOEMANS, WILLIAMSON - 1995
13: Interior point methods in semidefinite programming with applications to combinat.. - ALIZADEH - 1995
BibTeX entry: (Update)
M. LAURENT, S. POLJAK, and F. RENDL. Connections between semidefinite relaxations of the max-cut and stable set problems. Mathematical Programming, 1995. To appear. http://citeseer.ist.psu.edu/88243.html More
@article{ laurent97connections,
author = "M. {LAURENT} and S. {POLJAK} and F. {RENDL}",
title = "Connections between semidefinite relaxations of the max-cut and stable set problems",
journal = "Mathematical Programming",
volume = "77",
pages = "225--246",
year = "1997",
url = "citeseer.ist.psu.edu/88243.html" }
Citations (may not include all citations):333 Geometric algorithms and combinatorial optimization (context) - Grotschel, Lov'asz et al. - 1988
117 A lift-and-project cutting plane algorithm for mixed 0-1 pro.. (context) - Balas, Ceria et al. - 1993
115 Approximating the value of two prover proof systems (context) - Feige, Goemans - 1995
106 approximation algorithms for MAX CUT and MAX 2SAT (context) - Goemans, Williamson - 1994
33 Mathematical Programming (context) - Barahona, Mahjoub et al. - 1986
30 Positive definite completions of partial hermitian matrices (context) - Grone, Johnson et al. - 1984
20 The boolean quadric polytope: some characteristics (context) - Padberg - 1989
19 Polyhedral methods for the maximum clique problem (context) - Balas, Ceria et al. - 1994
18 The Lov'asz theta function and a semidefinite programming re.. - Kleinberg, Goemans - 1995
11 A primal-dual interior point method for the max-min eigenval.. (context) - Helmberg, Rendl et al.
11 a positive semidefinite relaxation of the cut polytope - Laurent, Poljak - 1993
10 complementation and persistency in quadratic 0-1 optimizatio.. (context) - Hammer, Hansen et al. - 1984
8 On cuts and matchings in planar graphs (context) - Barahona - 1993
8 Some network flow problems solved with pseudo-boolean progra.. (context) - Hammer - 1965
7 Laplacian eigenvalues and the max-cut problem (context) - Delorme, Poljak - 1993
5 The real positive semidefinite completion problem for series.. (context) - Laurent - 1994
5 The real positive definite completion problem: cycle complet.. (context) - Barrett, Johnson et al.
4 the expected relative error of the polyhedral approximation .. (context) - Poljak, Tuza - 1994
4 IEEE Transactions on Information Theory (context) - Schrijver, of et al. - 1979
4 the facial structure of the set of correlation matrices - Laurent, Poljak - 1995
3 Updated semi-definite constraints (context) - Balas, Ceria et al. - 1994
3 Cones of matrices and set-functions and 0 \Gamma 1 optimizat.. (context) - Lov'asz, Schrijver - 1991
2 The characterization of graphs with all subgraphs t-perfect (context) - Gerards, Shepherd - 1995
2 Nonlinear relaxation of the graph-bisection problems (context) - Poljak, Rendl
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://orion.math.uwaterloo.ca/~hwolkowi/henry/software/psd_tool.d/poljak.d/svata.html): More
One-Third-Integrality in the Max-Cut Problem - Laurent, Poljak (Correct)
Gap Inequalities for the Cut Polytope - Laurent, Poljak (Correct)
On the Facial Structure of the Set of Correlation Matrices - Laurent, Poljak (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC