Pages that link to "Item:Q1316645"

The following pages link to The hypermetric cone is polyhedral (Q1316645):

Displaying 23 items.

• Complexity results for the gap inequalities for the max-cut problem (Q439900) (← links)
• On a class of metrics related to graph layout problems (Q603106) (← links)
• Binary positive semidefinite matrices and associated integer polytopes (Q662294) (← links)
• Zonoid theory and Hilbert's fourth problem (Q1112336) (← links)
• Facets for the cut cone. I (Q1199749) (← links)
• Facets for the cut cone. II: Clique-web inequalities (Q1199750) (← links)
• Solving quadratic (0,1)-problems by semidefinite programs and cutting planes (Q1290621) (← links)
• Lattice-free polytopes and their diameter (Q1346126) (← links)
• Finite metric spaces of strictly negative type (Q1377510) (← links)
• Membership testing for Bernoulli and tail-dependence matrices (Q1795588) (← links)
• A bound on the \(k\)-gonality of facets of the hypermetric cone and related complexity problems (Q1803268) (← links)
• The six-dimensional Delaunay polytopes (Q1826970) (← links)
• Application of cut polyhedra. I (Q1891019) (← links)
• Applications of cut polyhedra. II (Q1891020) (← links)
• Delaunay transformations of a Delaunay polytope (Q1906251) (← links)
• Binary Positive Semidefinite Matrices and Associated Integer Polytopes (Q3503844) (← links)
• The Hypermetric Cone on Seven Vertices (Q4651435) (← links)
• Small Cones of Oriented Semi-Metrics (Q4814266) (← links)
• The Boolean Quadric Polytope (Q5050144) (← links)
• Semidefinite programming and combinatorial optimization (Q5906394) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5917881) (← links)
• Semidefinite relaxations for partitioning, assignment and ordering problems (Q5925162) (← links)
• A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)