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 7 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)
- Computing convex hulls and counting integer points with \texttt{polymake} (Q2398105) (← 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)
