See this document in CiteSeerX!

unknown  (Make Corrections)  
Strengthenedsemidefiniteprogramming Relaxations For Chapter 1 Strengthenedsemidefiniteprogramming Relaxations For The Max-Cut...



  Home/Search   Context   Related

 
View or download:
orion.math.uwaterloo....ACAGOProc.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  orion.math.uwaterloo.ca/~hwolk... (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: In this paper we summarize recent results on finding tight semidefinite programming relaxations for the Max-Cut problem and hence tight upper bounds on its optimal value. Our results hold for every instance of Max-Cut and in particular we make no assumptions on the edge weights. We present two strengthenings of the well-known semidefinite programming relaxation of Max-Cut studied by Goemans and Williamson. Preliminary numerical results comparing the relaxations on several interesting instances... (Update)

Similar documents (at the sentence level):
14.4%:   Semidefinite Programming for Discrete Optimization and.. - Wolkowicz, Anjos (2000)   (Correct)
10.5%:   A Tight Semidefinite Relaxation of the Cut Polytope - Anjos, Wolkowicz (2000)   (Correct)

Active bibliography (related documents):   More   All
0.8:   Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004)   (Correct)
0.4:   Geometry of Semide - Nite Max-Cut Relaxations   (Correct)
0.4:   Structured Semidefinite Programs and Semialgebraic Geometry.. - Parrilo (2000)   (Correct)

Similar documents based on text:
0.0:   Unknown -   (Correct)

BibTeX entry:   (Update)

@misc{ for-unknown,
  author = "Strengthenedsemidefiniteprogramming Relaxations For",
  title = "unknown",
  url = "citeseer.ist.psu.edu/763644.html" }
Citations (may not include all citations):
773   Reducibility among combinatorial problems (context) - KARP - 1972
326   Interior Point Polynomial Algorithms in Convex Programming (context) - NESTEROV, NEMIROVSKII - 1994
230   Interior point methods in semidefinite programming with appl.. - ALIZADEH - 1995
173   An interior point method for semidefinite programming and ma.. - HELMBERG - 1994
173   An interior-point method for semidefinite programming - HELMBERG, RENDL et al. - 1996
106   approximation algorithms for MAX CUT and MAX 2SAT (context) - GOEMANS, WILLIAMSON - 1994
60   Combinatorial optimization with interior point methods and s.. (context) - ALIZADEH - 1991
55   A spectral bundle method for semidefinite programming - HELMBERG, RENDL - 2000  ACM
53   Geometry of cuts and metrics (context) - DEZA, LAURENT - 1997
35   Nonpolyhedralrelaxations of graph-bisection problems - POLJAK, RENDL - 1995
35   Eigenvalues in combinatorial optimization (context) - MOHAR, POLJAK - 1993
28   How good is the Goemans-Williamson MAX CUT algorithm (context) - KARLOFF - 1999
26   On Lagrangian relaxation of quadratic matrix constraints - ANSTREICHER, WOLKOWICZ - 2000  ACM
22   Connections between semidefinite relaxations of the max-cut .. - LAURENT, POLJAK et al. - 1997  ACM
21   The max-cut problem on graphs not contractible to K (context) - BARAHONA - 1983
20   Optimization over positive semidefinite matrices: Mathematic.. (context) - NESTEROV, NEMIROVSKII - 1990
15   A strengthened SDP relaxation via a second lifting for the M.. - ANJOS, WOLKOWICZ - 1999
9   Bundle methods to minimize the maximum eigenvalue function - HELMBERG, OUSTRY - 2000
8   On cuts and matchings in planar graphs (context) - BARAHONA - 1993  ACM
6   Strong duality for a trust-region type relaxation of the qua.. - ANSTREICHER, CHEN et al. - 1999
5   SDPpack user's guide -- version (context) - ALIZADEH, HAEBERLY et al.
3   A tightsemidefinite relaxation of the cut polytope - ANJOS, WOLKOWICZ - 2000

Documents on the same site (http://orion.math.uwaterloo.ca/~hwolkowi/henry/reports/):   More
Regularization Using a - Parameterized Trust Region   (Correct)
A Matrix-lifting Semidefinite Relaxation for the Quadratic.. - Yichuan Ding Henry   (Correct)
Semidefinite Programming - Henry Wolkowicz October   (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