The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
From MaRDI portal
Publication:6113351
DOI10.1016/j.ejor.2023.04.028arXiv2302.04252MaRDI QIDQ6113351
Gábor Domokos, Sándor Bozóki, David Papp, Krisztina Regős
Publication date: 11 July 2023
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2302.04252
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic for the circle packing problem with a variety of containers
- Static equilibria of rigid bodies: Dice, pebbles, and the Poincaré-Hopf theorem
- Exploiting special structure in semidefinite programming: a survey of theory and applications
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- A multilevel analysis of the Lasserre hierarchy
- Iterated dynamic thresholding search for packing equal circles into a circular container
- The exact solutions of several types of container loading problems
- A proof of the Kepler conjecture
- Global Optimization with Polynomials and the Problem of Moments
- Certified Roundoff Error Bounds Using Semidefinite Programming
- Experimental Study of Energy-Minimizing Point Configurations on Spheres
- New Lower Bounds and Asymptotics for the cp-Rank
- New upper bounds for kissing numbers from semidefinite programming
- Monostatic Simplexes
- CSDP, A C library for semidefinite programming
- Optimal Designs for Rational Function Regression
- Exact Semidefinite Programming Bounds for Packing Problems
- Balancing polyhedra
- Moment methods in energy minimization: New bounds for Riesz minimal energy problems
- The Complexity of Simple Models—A Study of Worst and Typical Hard Cases for the Standard Quadratic Optimization Problem
- Improved Bounds for the Crossing Numbers of Km,n and Kn
- A Survey of the S-Lemma
- Positive trigonometric polynomials and signal processing applications
- Quadratically adjustable robust linear optimization with inexact data via generalized S-lemma: exact second-order cone program reformulations
This page was built for publication: The smallest mono-unstable convex polyhedron with point masses has 8 faces and 11 vertices
