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 46 items.
- Facet-inducing web and antiweb inequalities for the graph coloring polytope (Q608302) (← links)
- On the facets of the stable set polytope of quasi-line graphs (Q635515) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- A note on node packing polytopes on hypergraphs (Q790042) (← links)
- A conditional logic approach for strengthening mixed 0-1 linear programs (Q817194) (← links)
- A construction for non-rank facets of stable set polytopes of webs (Q852709) (← links)
- Clique-circulants and the stable set polytope of fuzzy circular interval graphs (Q948961) (← links)
- On packing and covering polyhedra of consecutive ones circulant clutters (Q987683) (← links)
- Gear composition and the stable set polytope (Q1003487) (← links)
- On the set covering polyhedron of circulant matrices (Q1015320) (← links)
- Triangle-free strongly circular-perfect graphs (Q1025560) (← links)
- \(K_ i\)-covers. I: Complexity and polytopes (Q1070249) (← links)
- On ternary problems (Q1121787) (← 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)
- The Boolean quadratic polytope: Some characteristics, facets and relatives (Q1122479) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- Graphical properties related to minimal imperfection (Q1132889) (← links)
- Polytope des independants d'un graphe série-parallèle (Q1147168) (← links)
- 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)
- A class of web-based facets for the generalized vertex packing problem (Q1763480) (← links)
- Facets and algorithms for capacitated lot sizing (Q1823857) (← 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 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)
- Almost all webs are not rank-perfect (Q2583128) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- On the Chvátal-rank of Antiwebs (Q2883565) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← 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)
- (Q5708520) (← links)
- (Q5708546) (← links)
- (Q5708566) (← links)
- New facets for the set packing polytope (Q5929145) (← links)