Semidefinite programming relaxations for the graph partitioning problem
type: Item
instance of: scholarly article
title: Semidefinite programming relaxations for the graph partitioning problem
zbMATH Open document ID: 0932.90030
DOI: 10.1016/S0166-218X(99)00102-X
author: Henry Wolkowicz
author: Qing Zhao
published in: Discrete Applied Mathematics
publication date: 2000-03-21T00:00:00Z
Mathematics Subject Classification ID: 90C25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 15B48
zbMATH DE Number: 1389882
zbMATH Keywords: graph partitioning
zbMATH Keywords: Lagrangian relaxations
zbMATH Keywords: semidefinite programming relaxations
zbMATH Keywords: gangster operator
describes a project that uses: COL
MaRDI profile type: Publication
cites work: Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
cites work: On Lagrangian relaxation of quadratic matrix constraints
cites work: A lift-and-project cutting plane algorithm for mixed 0-1 programs
cites work: The lattice of faces of a finite dimensional cone
cites work: Cones of diagonally dominant matrices
cites work: Solving Large-Scale Sparse Semidefinite Programs for Combinatorial Optimization
cites work: Lower Bounds for the Partitioning of Graphs
cites work: A computational study of graph partitioning
cites work: Very fast simulated re-annealing
cites work: Q3126750
cites work: Solving Graph Bisection Problems with Semidefinite Programming
cites work: An Efficient Heuristic Procedure for Partitioning Graphs
cites work: Q3997942
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: A projection technique for partitioning the nodes of a graph
cites work: Q3802887
cites work: Semidefinite programming relaxations for the quadratic assignment problem
description: scientific article; zbMATH DE number 1389882