Requiring connectivity in the set covering problem
type: Item
instance of: scholarly article
title: Requiring connectivity in the set covering problem
zbMATH Open document ID: 1066.90133
published in: Journal of Combinatorial Optimization
publication date: 2005-05-17T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 2168264
zbMATH Keywords: set covering
zbMATH Keywords: graphs
zbMATH Keywords: connected components
zbMATH Keywords: integer polytopes
author: Jorge Orestes Cerdeira
author: Leonor Santiago Pinto
MaRDI profile type: Publication
full work available at URL: s10878-005-5482-5
OpenAlex ID: W2042669436
cites work: On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
cites work: On the 0,1 facets of the set covering polytope
cites work: Facet of regular 0–1 polytopes
cites work: Facets and lifting procedures for the set covering polytope
cites work: Q5686064
cites work: On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
cites work: Q5545849
cites work: On the facial structure of the set covering polytope
cites work: Q4247444
cites work: Faces for a linear inequality in 0–1 variables
DOI: 10.1007/S10878-005-5482-5
description: scientific article; zbMATH DE number 2168264