nite Max-Cut Relaxations via Matrix Ranks Miguel F. Anjos Henry Wolkowicz...  Home/Search
Context
Related
| orion.math.uwaterloo....geomranks.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/~hwolk... (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Semide nite programming (SDP) relaxations are proving to be a powerful tool for nding tight bounds for hard discrete optimization problems. (Update)
Active bibliography (related documents): More All
2.0: Semidefinite Programming for Discrete Optimization and.. - Wolkowicz, Anjos (2000) (Correct)
0.7: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
0.5: A Tight Semidefinite Relaxation of the Cut Polytope - Anjos, Wolkowicz (2000) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ relaxations-geometry,
author = "Nite Max-Cut Relaxations",
title = "Geometry of Semide",
url = "citeseer.ist.psu.edu/763700.html" }
Citations (may not include all citations):4212 Computers and Intractability: A guide to the theory of NP{co.. (context) - GAREY, JOHNSON - 1979
773 Reducibility among combinatorial problems (context) - KARP - 1972
708 Cambridge University Press (context) - HORN, JOHNSON - 1990
415 Improved approximation algorithms for maximum cut and satis .. - GOEMANS, WILLIAMSON - 1995
264 Combinatorial algorithms for integrated circuit layout (context) - LENGAUER - 1990
120 Some optimal inapproximability results (context) - HASTAD - 1997
106 approximation algorithms for MAX CUT and MAX 2SAT (context) - GOEMANS, WILLIAMSON - 1994
71 Solving large-scale sparse semidefinite programs for combina.. - BENSON, YE et al. - 2000
53 Geometry of cuts and metrics (context) - DEZA, LAURENT - 1997
40 Approximating quadratic programming with bound and quadratic.. - YE - 1999
36 An application of combinatorial optimization to statistical .. (context) - BARAHONA, GR et al. - 1988
35 Eigenvalues in combinatorial optimization (context) - MOHAR, POLJAK - 1993
21 The max-cut problem on graphs not contractible to K (context) - BARAHONA - 1983
20 the cut polytope (context) - BARAHONA, MAHJOUB - 1986
19 An interior-point method for semide nite programming (context) - HELMBERG, RENDL et al. - 1996
19 Semide nite programming in combinatorial optimization (context) - GOEMANS - 1997
19 An interior-point method for semide nite programming and max.. (context) - HELMBERG - 1994
18 HANDBOOK OF SEMIDEFINITE PROGRAMMING: Theory (context) - WOLKOWICZ, SAIGAL et al. - 2000
15 A strengthened SDP relaxation via a second lifting for the M.. - ANJOS, WOLKOWICZ
15 A spectral bundle method for semide nite programming (context) - HELMBERG, RENDL - 2000
13 Combinatorial optimization (context) - GOEMANS, RENDL - 2000
10 Structured semide nite programs and semialgebraic geometry m.. (context) - PARRILO - 2000
9 New Convex Relaxations for the Maximum Cut and VLSI Layout P.. (context) - ANJOS - 2001
9 Bundle methods to minimize the maximum eigenvalue function - HELMBERG, OUSTRY - 2000
8 On cuts and matchings in planar graphs (context) - BARAHONA - 1993
8 the optimality of the random hyperplane rounding technique f.. - FEIGE, SCHECHTMAN - 2000
6 An ecient algorithm for solving the MAXCUT SDP relaxation (context) - BURER, MONTEIRO - 1999
5 Quality of semide nite relaxation for nonconvex quadratic op.. (context) - NESTEROV - 1997
5 Optimality conditions and lmi relaxations for 0-1 programs (context) - LASSERRE - 2000
3 Combining semide nite and polyhedral relaxations for integer.. (context) - HELMBERG, POLJAK et al. - 1995
3 Semide nite programming relaxations of nonconvex quadratic o.. (context) - NESTEROV, WOLKOWICZ et al. - 2000
3 the facial structure of the correlation matrices (context) - LAURENT, POLJAK - 1996
2 Semide nite programming and combinatorial optimization (context) - RENDL - 1999
2 Tighter linear and semide nite relaxations for max-cut based.. (context) - LAURENT - 2000
1 a positive semide nite relaxation of the cut polytope (context) - LAURENT, POLJAK - 1995
1 Semide nite programming and combinatorial optimization (context) - GOEMANS - 1998
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