Pages that link to "Item:Q2349135"

The following pages link to A semidefinite programming hierarchy for packing problems in discrete geometry (Q2349135):

Displaying 18 items.

• A copositive formulation for the stability number of infinite graphs (Q344928) (← links)
• An inequality for circle packings proved by semidefinite programming (Q701787) (← links)
• Mixed-integer nonlinear optimization: a hatchery for modern mathematics. Abstracts from the workshop held June 2--8, 2019 (Q782997) (← links)
• Inverse convex programming and parallelepiped packing (Q1364041) (← links)
• Dual bounds for the positive definite functions approach to mutually unbiased bases (Q2098296) (← links)
• Complete positivity and distance-avoiding sets (Q2118086) (← links)
• \(k\)-point semidefinite programming bounds for equiangular lines (Q2149560) (← links)
• Multistage approach to solving the optimization problem of packing nonconvex polyhedra (Q2215293) (← links)
• Sphere packing and quantum gravity (Q2303146) (← links)
• The density of sets avoiding distance 1 in Euclidean space (Q2351016) (← links)
• Approximating the cone of copositive kernels to estimate the stability number of infinite graphs (Q2413190) (← links)
• Fast First-Order Algorithms for Packing–Covering Semidefinite Programs (Q3454972) (← links)
• Bidimensional Packing by Bilinear Programming (Q3596354) (← links)
• Exact Semidefinite Programming Bounds for Packing Problems (Q4989941) (← links)
• Moment methods in energy minimization: New bounds for Riesz minimal energy problems (Q5217870) (← links)
• A Note on Lattice Packings via Lattice Refinements (Q5374123) (← links)
• Globally Optimizing Small Codes in Real Projective Spaces (Q5854456) (← links)
• The <i>b</i>‐bibranching problem: TDI system, packing, and discrete convexity (Q6065852) (← links)