Pages that link to "Item:Q5470826"

The following pages link to Improved Bounds for the Crossing Numbers of Km,n and Kn (Q5470826):

Displayed 25 items.

• Copositive optimization -- recent developments and applications (Q421783) ‎ (← links)
• Think co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimization (Q427378) ‎ (← links)
• The optimal drawings of \(K_{5,n}\) (Q463036) ‎ (← links)
• Using symmetry to optimize over the Sherali-Adams relaxation (Q482114) ‎ (← links)
• Numerical block diagonalization of matrix \(\ast\)-algebras with application to semidefinite programming (Q717133) ‎ (← links)
• Exploiting group symmetry in semidefinite programming relaxations of the quadratic assignment problem (Q847851) ‎ (← links)
• Reduction of symmetric semidefinite programs using the regular \(\ast\)-representation (Q868475) ‎ (← links)
• A linear programming reformulation of the standard quadratic optimization problem (Q868634) ‎ (← links)
• The complexity of optimizing over a simplex, hypercube or sphere: a short survey (Q940826) ‎ (← links)
• A branch-and-cut approach to the crossing number problem (Q951113) ‎ (← links)
• Exploiting group symmetry in truss topology optimization (Q1041375) ‎ (← links)
• Exploiting special structure in semidefinite programming: a survey of theory and applications (Q1044129) ‎ (← links)
• Symmetric sums of squares over \(k\)-subset hypercubes (Q1702778) ‎ (← links)
• Crossing numbers and stress of random graphs (Q1725756) ‎ (← links)
• Crossing number for graphs with bounded pathwidth (Q1986966) ‎ (← links)
• Rectilinear crossings in complete balanced \(d\)-partite \(d\)-uniform hypergraphs (Q2175816) ‎ (← links)
• A Comprehensive Analysis of Polyhedral Lift-and-Project Methods (Q2790405) ‎ (← links)
• Invariant Semidefinite Programs (Q2802527) ‎ (← links)
• (Q2857359) ‎ (← links)
• Reduction of truss topology optimization (Q3052591) ‎ (← links)
• A new branch-and-bound algorithm for standard quadratic programming problems (Q4646674) ‎ (← links)
• A survey of graphs with known or bounded crossing numbers (Q5139701) ‎ (← links)
• Closing in on Hill's Conjecture (Q5232152) ‎ (← links)
• Turán’s Brick Factory Problem: The Status of the Conjectures of Zarankiewicz and Hill (Q5506784) ‎ (← links)
• The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices (Q6113351) ‎ (← links)