On a positive semidefinite relaxation of the cut polytope
type: Item
instance of: scholarly article
title: On a positive semidefinite relaxation of the cut polytope
zbMATH Open document ID: 0835.90078
DOI: 10.1016/0024-3795(95)00271-R
author: Monique Laurent
author: Svatopluk Poljak
published in: Linear Algebra and its Applications
publication date: 1995-07-24T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 778269
zbMATH Keywords: geometric properties
zbMATH Keywords: max-cut problem
MaRDI profile type: Publication
cites work: On the cut polytope
cites work: Cones of diagonally dominant matrices
cites work: A note on extreme positive definite matrices
cites work: Laplacian eigenvalues and the maximum cut problem
cites work: Combinatorial properties and the complexity of a max-cut approximation
cites work: The performance of an eigenvalue bound on the max-cut problem in some classes of graphs
cites work: Facets for the cut cone. I
cites work: The cut cone. III: On the role of triangle facets
cites work: Semi-Definite Matrix Constraints in Optimization
cites work: Q4198056
cites work: .878-approximation algorithms for MAX CUT and MAX 2SAT
cites work: Extremal correlation matrices
cites work: Geometric algorithms and combinatorial optimization.
cites work: Finding a Maximum Cut of a Planar Graph in Polynomial Time
cites work: The cone of distance matrices
cites work: On the cone of positive semidefinite matrices
cites work: A Note on Extreme Correlation Matrices
cites work: Extreme points of a convex subset of the cone of positive semidefinite matrices
cites work: Q5659589
cites work: Nonpolyhedral Relaxations of Graph-Bisection Problems
cites work: Node and edge relaxations of the max-cut problem
cites work: Remarks to Maurice Frechet's article ``Sur la definition axiomatique d'une classe d'espaces vectoriels distancies applicables vectoriellement sur l'espace de Hilbert''
description: scientific article; zbMATH DE number 778269