Relaxations of vertex packing
type: Item
instance of: scholarly article
title: Relaxations of vertex packing
zbMATH Open document ID: 0596.05052
DOI: 10.1016/0095-8956(86)90087-0
published in: Journal of Combinatorial Theory. Series B
publication date: 1986-01-01T00:00:00Z
full work available at URL: https://ir.cwi.nl/pub/10059
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 3959481
zbMATH Keywords: algorithm
zbMATH Keywords: upper bound
zbMATH Keywords: weighted independence number
zbMATH Keywords: graph
zbMATH Keywords: vertex packing polytope
author: Martin Grötschel
author: László Lovász
author: Alexander Schrijver
MaRDI profile type: Publication
OpenAlex ID: W2012937096
cites work: Polytope des independants d'un graphe série-parallèle
cites work: On certain polytopes associated with graphs
cites work: Transformations which Preserve Perfectness and H-Perfectness of Graphs
cites work: Blocking and anti-blocking pairs of polyhedra
cites work: Q5685113
cites work: Q3328583
cites work: The ellipsoid method and its consequences in combinatorial optimization
cites work: Q3216686
cites work: Normal hypergraphs and the perfect graph conjecture
cites work: On the Shannon capacity of a graph
cites work: Q3320435
Recommended article: On the vertex packing problem
Recommended article: Q3741078
Recommended article: Graph packings
Recommended article: Q4340018
Recommended article: Packing vertices and edges in random regular graphs
Recommended article: Packing parameters in graphs
Recommended article: Packings in Dense Regular Graphs
Recommended article: A polyhedral study of the generalized vertex packing problem
Recommended article: Packings in complete graphs
Recommended article: Q3715136
description: scientific article; zbMATH DE number 3959481