Pages that link to "Item:Q1220520"
From MaRDI portal
The following pages link to A class of facet producing graphs for vertex packing polyhedra (Q1220520):
Displayed 50 items.
- On stable set polyhedra for K//(1,3)free graphs (Q1168982) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case (Q1278287) (← links)
- The maximum clique problem (Q1318271) (← links)
- Vertex packing problem application to the design of electronic testing fixtures (Q1339134) (← links)
- Clique family inequalities for the stable set polytope of quasi-line graphs. (Q1414593) (← links)
- New valid inequalities and facets for the simple plant location problem (Q1749485) (← links)
- Lifted, projected and subgraph-induced inequalities for the representatives \(k\)-fold coloring polytope (Q1751169) (← links)
- On the mixed set covering, packing and partitioning polytope (Q1751181) (← links)
- A class of web-based facets for the generalized vertex packing problem (Q1763480) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- Extended formulations for vertex cover (Q1790198) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Strengthened clique-family inequalities for the stable set polytope (Q2060608) (← links)
- Dynamic node packing (Q2097666) (← links)
- Persistency of linear programming relaxations for the stable set problem (Q2118136) (← links)
- RLT insights into lift-and-project closures (Q2257076) (← links)
- A new lifting theorem for vertex packing (Q2329651) (← links)
- Tree-width and the Sherali-Adams operator (Q2386210) (← links)
- An application of the Lovász-Schrijver \(M(K, K)\) operator to the stable set problem (Q2390997) (← links)
- On the complete set packing and set partitioning polytopes: properties and rank 1 facets (Q2417173) (← links)
- 2-clique-bond of stable set polyhedra (Q2446841) (← links)
- On classes of minimal circular-imperfect graphs (Q2482095) (← links)
- Exploring the relationship between max-cut and stable set relaxations (Q2490329) (← links)
- On non-rank facets of stable set polytopes of webs with clique number four (Q2492218) (← links)
- A polyhedral study of the generalized vertex packing problem (Q2492699) (← links)
- Searching for mutually orthogonal Latin squares via integer and constraint programming (Q2496074) (← links)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (Q2509770) (← links)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- Generating irreducible copositive matrices using the stable set problem (Q2664002) (← links)
- Total coloring and total matching: polyhedra and facets (Q2673562) (← links)
- On the facets of stable set polytopes of circular interval graphs (Q2673814) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- A lower bound on the Chvátal-rank of Antiwebs (Q2840740) (← links)
- (Q2857431) (← links)
- On the Chvátal-rank of Antiwebs (Q2883565) (← links)
- On the 2-Club Polytope of Graphs (Q2957469) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← links)
- Lovász and Schrijver $$N_+$$-Relaxation on Web Graphs (Q3195330) (← links)
- On determining the imperfection ratio (Q3439498) (← links)
- Lifting the facets of zero–one polytopes (Q3865839) (← links)
- Some facets of the simple plant location polytope (Q3945954) (← links)
- Transitive packing (Q4645940) (← links)
- Persistency of Linear Programming Relaxations for the Stable Set Problem (Q5041757) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- $t$-Perfection in $P_5$-Free Graphs (Q5348215) (← links)
- (Q5708520) (← links)