The following pages link to Application of cut polyhedra. I (Q1891019):
Displaying 16 items.
- A dynamic inequality generation scheme for polynomial programming (Q263184) (← links)
- Improved compact formulations for metric and cut polyhedra (Q325413) (← links)
- Generating cutting planes for the semidefinite relaxation of quadratic programs (Q337405) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
- Algebraic and numerical techniques for the computation of matrix determinants (Q1368466) (← links)
- Applications of cut polyhedra. II (Q1891020) (← links)
- Seminormality, canonical modules, and regularity of cut polytopes (Q1979324) (← links)
- Learning representations from dendrograms (Q2217438) (← 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)
- Monotone maps, sphericity and bounded second eigenvalue (Q2573647) (← links)
- Mathematical Programming Models and Exact Algorithms (Q5050146) (← links)
- Maximum Cut Parameterized by Crossing Number (Q5119374) (← links)
- Classes of cut ideals and their Betti numbers (Q6171836) (← links)
- Cycle algebras and polytopes of matroids (Q6199040) (← links)
