Facets and lifting procedures for the set covering polytope
From MaRDI portal
Publication:1123808
DOI10.1007/BF01589100zbMath0677.90055MaRDI QIDQ1123808
Publication date: 1989
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
webknapsackindependence systemsacyclic subdigraphcovering polytopenon- sequential lifting proceduresnon-Boolean facets
Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Boolean programming (90C09) Polytopes and polyhedra (52Bxx)
Related Items
Generalized minor inequalities for the set covering polyhedron related to circulant matrices, Some advances on the set covering polyhedron of circulant matrices, Alternative formulations for the set packing problem and their application to the winner determination problem, A branch-and-cut algorithm for the continuous error localization problem in data cleaning, Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities, On the dominating set polytope, Transitive packing, Polyhedra associated with identifying codes in graphs, The anti-join composition and polyhedra, Cutting planes in integer and mixed integer programming, Unnamed Item, Requiring connectivity in the set covering problem, The nonidealness index of rank-ideal matrices, How to recycle your facets, Computational experience with general cutting planes for the set covering problem, On the set covering polyhedron of circulant matrices, A Set Covering Approach for the Double Traveling Salesman Problem with Multiple Stacks, Polyhedra associated with locating-dominating, open locating-dominating and locating total-dominating sets in graphs
Cites Work
- A note on node packing polytopes on hypergraphs
- Facets of the knapsack polytope derived from disjoint and overlapping index configurations
- 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
- A generalization of antiwebs to independence systems and their canonical facets
- On the facial structure of the set covering polytope
- A class of facet producing graphs for vertex packing polyhedra
- A Cutting Plane Algorithm for the Linear Ordering Problem
- Solving Large-Scale Zero-One Linear Programming Problems
- On the acyclic subgraph polytope
- Generalizations of Cliques, Odd Cycles and Anticycles and Their Relation to Independence System Polyhedra
- On the Facial Structure of Independence System Polyhedra
- Lifting the facets of zero–one polytopes
- (1,k)-configurations and facets for packing problems
- Cutting planes from conditional bounds: A new approach to set covering
- Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
- Note—A Computational Survey of Methods for the Set Covering Problem
- Faces for a linear inequality in 0–1 variables
- Facets of the knapsack polytope
- Further facet generating procedures for vertex packing polytopes
- Facets of the Knapsack Polytope From Minimal Covers
- Covering, Packing and Knapsack Problems
- Properties of vertex packing and independence system polyhedra
- Set Covering by Single-Branch Enumeration with Linear-Programming Subproblems
- Unnamed Item
- Unnamed Item
