Requiring connectivity in the set covering problem

DOI10.1007/s10878-005-5482-5zbMath1066.90133OpenAlexW2042669436MaRDI QIDQ1774524

Jorge Orestes Cerdeira, Leonor Santiago Pinto

Publication date: 17 May 2005

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-005-5482-5

zbMATH Keywords

connected componentsgraphsset coveringinteger polytopes

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (4)

Optimal design of compact and functionally contiguous conservation management areas ⋮ The relation of connected set cover and group Steiner tree ⋮ Algorithms for connected set cover problem and fault-tolerant connected set cover problem ⋮ A new method to solve the fully connected reserve network design problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
• On the 0,1 facets of the set covering polytope
• On the facial structure of the set covering polytope
• Facets and lifting procedures for the set covering polytope
• On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
• Faces for a linear inequality in 0–1 variables
• Facet of regular 0–1 polytopes

This page was built for publication: Requiring connectivity in the set covering problem