The following pages link to Applications of cut polyhedra. II (Q1891020):
Displaying 18 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- 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)
- Seminormality, canonical modules, and regularity of cut polytopes (Q1979324) (← links)
- Penalized semidefinite programming for quadratically-constrained quadratic optimization (Q2022173) (← links)
- A study of the performance of classical minimizers in the quantum approximate optimization algorithm (Q2059592) (← 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)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- Solving SDP relaxations of max-cut problem with large number of hypermetric inequalities by L-BFGS-B (Q6155645) (← links)
- Classes of cut ideals and their Betti numbers (Q6171836) (← links)
- Cycle algebras and polytopes of matroids (Q6199040) (← links)
