The following pages link to Applications of cut polyhedra. II (Q1891020):
Displayed 9 items.
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- \(\ell_ 1\)-rigid graphs (Q1321589) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Clin d'oeil on \(L_1\)-embeddable planar graphs (Q1377613) (← links)
- A connection between positive semidefinite and Euclidean distance matrix completion problems (Q1381268) (← links)
- The coherency index (Q1584456) (← links)
- Application of cut polyhedra. I (Q1891019) (← links)
- New classes of facets of the cut polytope and tightness of \(I_{mm22}\) Bell inequalities (Q2381532) (← links)
- Generating facets for the cut polytope of a graph by triangular elimination (Q2465651) (← links)