On the 0,1 facets of the set covering polytope
From MaRDI portal
Publication:1122477
DOI10.1007/BF01582277zbMath0675.90054OpenAlexW1992197964MaRDI QIDQ1122477
Antonio Sassano, Cornuéjols, Gérard
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01582277
Programming involving graphs or networks (90C35) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Polytopes and polyhedra (52Bxx)
Related Items
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems, Generalized minor inequalities for the set covering polyhedron related to circulant matrices, A generalization of antiwebs to independence systems and their canonical facets, On cutting-plane proofs in combinatorial optimization, Facets and lifting procedures for the set covering polytope, Integer programming methods for solving binary interdiction games, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, Rank inequalities and separation algorithms for packing designs and sparse triple systems., A Boolean theory of signatures for tonal scales, Solving the minimum label spanning tree problem by mathematical programming techniques, Transitive packing, Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities, Enhancing an algorithm for set covering problems, On the mixed set covering, packing and partitioning polytope, Integer programming approach to static monopolies in graphs, Unnamed Item, Requiring connectivity in the set covering problem, Discrete relaxations of combinatorial programs, On a certain class of nonideal clutters, On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\), Computational experience with general cutting planes for the set covering problem, Unnamed Item, Directed Steiner problems with connectivity constraints, A parallel genetic algorithm to solve the set-covering problem, Airline crew scheduling: state-of-the-art
Cites Work
- Unnamed Item
- Unnamed Item
- \(K_ i\)-covers. I: Complexity and polytopes
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- On the facial structure of the set covering polytope
- A class of facet producing graphs for vertex packing polyhedra
- On certain polytopes associated with graphs
- On the Uncapacitated Plant Location Problem. II: Facets and Lifting Theorems
- Cutting planes from conditional bounds: A new approach to set covering
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Some facets of the simple plant location polytope
- Set Partitioning: A survey
- Further facet generating procedures for vertex packing polytopes
- Properties of vertex packing and independence system polyhedra
- On the facial structure of set packing polyhedra
- Balanced matrices
