Requiring connectivity in the set covering problem
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1302177 (Why is no real title available?)
- scientific article; zbMATH DE number 3259777 (Why is no real title available?)
- scientific article; zbMATH DE number 3424057 (Why is no real title available?)
- Faces for a linear inequality in 0–1 variables
- Facet of regular 0–1 polytopes
- Facets and lifting procedures for the set covering polytope
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\)
Cited in
(6)- Algorithms for connected set cover problem and fault-tolerant connected set cover problem
- The relation of connected set cover and group Steiner tree
- Connected Set Cover Problem and Its Applications
- The generalized reserve set covering problem with connectivity and buffer requirements
- Optimal design of compact and functionally contiguous conservation management areas
- A new method to solve the fully connected reserve network design problem
This page was built for publication: Requiring connectivity in the set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1774524)