Pages that link to "Item:Q1122477"
From MaRDI portal
The following pages link to On the 0,1 facets of the set covering polytope (Q1122477):
Displaying 32 items.
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices (Q299092) (← links)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← links)
- Solving the minimum label spanning tree problem by mathematical programming techniques (Q666399) (← links)
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- Airline crew scheduling: state-of-the-art (Q817210) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- On the facial structure of the set covering polytope (Q1122481) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← links)
- On the set covering polytope: Facets with coefficients in \(\{0,1,2,3\}\) (Q1265897) (← links)
- Directed Steiner problems with connectivity constraints (Q1315992) (← links)
- The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems (Q1333026) (← links)
- Recognizing facet defining inequalities (Q1384420) (← links)
- Rank inequalities and separation algorithms for packing designs and sparse triple systems. (Q1401311) (← links)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- Upper bounds on the maximal number of facets of 0/1-polytopes (Q1964653) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- A Boolean theory of signatures for tonal scales (Q2448914) (← links)
- On a certain class of nonideal clutters (Q2500534) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- Row family inequalities for the set covering polyhedron (Q2861548) (← links)
- Transitive packing (Q4645940) (← links)
- (Q5708482) (← links)
- Discrete relaxations of combinatorial programs (Q5946814) (← links)
- Tilted inequalities and facets of the set covering polytope: a theoretical analysis (Q6611016) (← links)
