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):
Displaying 29 items.
- 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)
- Computing the clique number of \(a\)-perfect graphs in polynomial time (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)
- (Q5708546) (← links)
- (Q5708566) (← links)
- New facets for the set packing polytope (Q5929145) (← links)
- Colorings of complements of line graphs (Q6056781) (← links)
- An extended formulation for the 1‐wheel inequalities of the stable set polytope (Q6068534) (← links)
- New variants of the simple plant location problem and applications (Q6106762) (← links)
