Pages that link to "Item:Q1122481"
From MaRDI portal
The following pages link to On the facial structure of the set covering polytope (Q1122481):
Displaying 50 items.
- A-priori upper bounds for the set covering problem (Q271942) (← links)
- Generalized minor inequalities for the set covering polyhedron related to circulant matrices (Q299092) (← links)
- An intermediate value theorem for face polytopes (Q323607) (← links)
- A polyhedral approach to locating-dominating sets in graphs (Q324734) (← links)
- Minor related row family inequalities for the set covering polyhedron of circulant matrices (Q324828) (← links)
- On covering of linear operators on polyhedral sets (Q327966) (← links)
- On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q584072) (← links)
- Strong formulation for the spot 5 daily photograph scheduling problem (Q613663) (← links)
- The anti-join composition and polyhedra (Q688264) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Vertex adjacencies in the set covering polyhedron (Q730484) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Formalization and solution of one class of covering problems for the design of monitoring and testing systems (Q918428) (← links)
- An algorithm for the difference between set covers (Q944712) (← links)
- The nonidealness index of rank-ideal matrices (Q987680) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results (Q1015318) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\) (Q1121793) (← links)
- On the 0,1 facets of the set covering polytope (Q1122477) (← links)
- A generalization of antiwebs to independence systems and their canonical facets (Q1122478) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- Enhancing an algorithm for set covering problems (Q1194745) (← 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)
- A parallel genetic algorithm to solve the set-covering problem (Q1603319) (← links)
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks (Q1751162) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- Progress on the description of identifying code polyhedra for some families of split graphs (Q1751187) (← links)
- Addendum to: ``Vertex adjacencies in the set covering polyhedron'' (Q1752476) (← links)
- Polyhedra associated with identifying codes in graphs (Q1752479) (← links)
- Integer programming approach to static monopolies in graphs (Q1752610) (← links)
- Lift-and-project ranks of the set covering polytope of circulant matrices (Q1759829) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- Requiring connectivity in the set covering problem (Q1774524) (← links)
- The face structure and geometry of marked order polyhedra (Q1789055) (← links)
- A special case of set covering problems (Q1908929) (← links)
- Ideal polytopes and face structures of some combinatorial optimization problems (Q1924055) (← links)
- The identifying code, the locating-dominating, the open locating-dominating and the locating total-dominating problems under some graph operations (Q2132340) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Approximation of the quadratic set covering problem (Q2427697) (← links)
- The minor inequalities in the description of the set covering polyhedron of circulant matrices (Q2441576) (← links)
- A branch-and-cut algorithm for graph coloring (Q2489906) (← links)
- How to recycle your facets (Q2506820) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- Integer programming methods for solving binary interdiction games (Q2672065) (← links)
- The set covering problem: Complexity, algorithms, experiments (Q2713942) (← links)
