New heuristics for the vertex coloring problem based on semidefinite programming
type: Item
instance of: scholarly article
title: New heuristics for the vertex coloring problem based on semidefinite programming
zbMATH Open document ID: 1267.90094
author: Jelena Govorčin
author: Nebojša Gvozdenović
author: Janez Povh
published in: CEJOR. Central European Journal of Operations Research
publication date: 2013-07-08T00:00:00Z
Mathematics Subject Classification ID: 90C22
Mathematics Subject Classification ID: 13J30
Mathematics Subject Classification ID: 14P10
Mathematics Subject Classification ID: 47A57
Mathematics Subject Classification ID: 08B20
zbMATH DE Number: 6185058
zbMATH Keywords: semidefinite programming
zbMATH Keywords: vertex coloring problem
zbMATH Keywords: boundary point method
MaRDI profile type: Publication
full work available at URL: s10100-012-0276-1
OpenAlex ID: W2032367325
cites work: New approximation guarantee for chromatic number
cites work: Semidefinite programming relaxations for graph coloring and maximal clique problems
cites work: A semidefinite programming-based heuristic for graph coloring
cites work: Computing Semidefinite Programming Lower Bounds for the (Fractional) Chromatic Number Via Block-Diagonalization
cites work: Block-diagonal semidefinite programming hierarchies for 0/1 programming
cites work: Approximate graph coloring by semidefinite programming
cites work: On the Shannon capacity of a graph
cites work: Regularization Methods for Semidefinite Programming
cites work: Copositive and semidefinite relaxations of the quadratic assignment problem
cites work: A boundary point method to solve semidefinite programs
DOI: 10.1007/S10100-012-0276-1
description: scientific article; zbMATH DE number 6185058