| Alternate document: Details Semidefinite Programming Relaxations For Set Partitioning Problems (96) Henry Wolkowicz, Qing Zhao |
Henry Wolkowicz, Qing Zhao  Home/Search
Context Related
| orion.math.uwaterloo....graphpart.ps.gz orion.uwaterloo.ca/pu...graphpart.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....ABSTRACTS (more) From: zib.de/helmberg/semidef (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: A semidefinite programming, SDP, relaxation for the graph partitioning problem, GP, is derived using the dual of the (homogenized) Lagrangian dual of appropriate equivalent representations of GP. The special structure of the relaxation is exploited in order to project the SDP onto the minimal face, of the cone of positive semidefinite matrices, which contains the feasible set. This guarantees that the Slater constraint qualification holds; which allows for a primal-dual interior-point solution... (Update)
Cited by: More
A k-Partition, Graph Theoretic Approach to.. - Byrne, Gandhe.. (2003) (Correct)
A Near Maximum Likelihood Decoding Algorithm for.. - Mobasher.. (2005) (Correct)
An Efficient Quasi-Maximum Likelihood Decoding for .. - Mobasher.. (2005) (Correct)
Similar documents (at the sentence level):
19.6%: Semidefinite Programming for Assignment and Partitioning Problems - Zhao (1996) (Correct)
Active bibliography (related documents): More All
0.6: Semidefinite and Cone Programming Bibliography/Comments - Wolkowicz (2004) (Correct)
0.3: Semidefinite Programming and Combinatorial Optimization - Rendl (1998) (Correct)
0.2: Strong Duality For Semidefinite Programming - Ramana, Tunçel, Wolkowicz (1995) (Correct)
Similar documents based on text: More All
0.4: Semidefinite Programming Relaxations For The.. - Zhao, Karisch.. (1998) (Correct)
0.3: On The Slater Condition For The SDP Relaxations Of Nonconvex Sets - Tunçel (2000) (Correct)
0.3: An Improved Semidefinite Programming Relaxation for the.. - Anjos (2002) (Correct)
Related documents from co-citation: More All
10: An interior-- point method for semidefinite programming - Helmberg, Rendl et al. - 1996
9: Primal-dual interior-point methods for semidefinite programming - Alizadeh, Haeberly et al. - 1994
8: Improved approximation algorithms for maximum cut and satisfiability problems us.. - GOEMANS, WILLIAMSON - 1995
BibTeX entry: (Update)
H. Wolkowicz and Q. Zhao. Semidefinite programming relaxations for the graph partitioning problem. Technical report, Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, N2L 3G1 Canada, October 1996. http://citeseer.ist.psu.edu/wolkowicz96semidefinite.html More
@techreport{ wolkowicz96semidefinite,
author = "Henry Wolkowicz and Qing Zhao",
title = "Semidefinite programming relaxations for the graph partitioning problem",
address = "Waterloo, ON, Canada",
pages = "17",
year = "1996",
url = "citeseer.ist.psu.edu/wolkowicz96semidefinite.html" }
Citations (may not include all citations):429 An efficient heuristic procedure for partitioning graphs (context) - KERNIGHAN, LIN - 1970
264 Combinatorial algorithms for integrated circuit layout (context) - LENGAUER - 1990
82 Lower bounds for the partitioning of graphs (context) - DONATH, HOFFMAN - 1973
81 Very fast simulated re-annealing - INGBER - 1989
41 A projection technique for partitioning the nodes of a graph - RENDL, WOLKOWICZ - 1995
35 Semidefinite programming relaxations for the quadratic assig.. - ZHAO, KARISCH et al. - 1995
26 A computational study of graph partitioning - FALKNER, RENDL et al. - 1994
23 Cones of diagonally dominant matrices (context) - BARKER, CARLSON - 1975
15 Nonlinear Approaches for Quadratic Assignment and Graph Part.. (context) - KARISCH - 1995
14 An efficient eigenvector approach for finding netlist partit.. (context) - HADLEY, MARK et al. - 1992
10 Semidefinite programming and graph equipartition - KARISCH, RENDL - 1995
8 Semidefinite Programming for Assignment and Partitioning Pro.. - ZHAO - 1996
5 The lattice of faces of a finite dimensional cone (context) - BARKER - 1973
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/reports/ABSTRACTS.html): More
Strong Duality for a Trust-Region Type Relaxation.. - Anstreicher, Chen, .. (1998) (Correct)
SQ^P, Sequential Quadratic Constrained Quadratic Programming - Kruk, Wolkowicz (1998) (Correct)
Symmetrization of Nonsymmetric Quadratic Assignment.. - Hadley, Rendl, Wolkowicz (1996) (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