Pages that link to "Item:Q2465651"
From MaRDI portal
The following pages link to Generating facets for the cut polytope of a graph by triangular elimination (Q2465651):
Displaying 11 items.
- Lifting and separation procedures for the cut polytope (Q403653) (← links)
- On the extension complexity of combinatorial polytopes (Q745682) (← links)
- On Hilbert bases of cuts (Q898132) (← links)
- Lifting facets of the cut polytope (Q923115) (← links)
- Generating facets for finite master cyclic group polyhedra using \(n\)-step mixed integer rounding functions (Q992583) (← links)
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities (Q2381532) (← links)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← links)
- Enumeration of the facets of cut polytopes over some highly symmetric graphs (Q2827757) (← links)
- Necessary conditions for extended noncontextuality in general sets of random variables (Q4583102) (← links)
- On the inequivalence of the CH and CHSH inequalities due to finite statistics (Q5347999) (← links)
- The Bipartite Boolean Quadric Polytope with Multiple-Choice Constraints (Q6060149) (← links)
