The Kissing Number Problem: A New Result from Global Optimization

DOI10.1016/J.ENDM.2004.03.040MaRDI QIDQ3439154zbMATH OpenOpenAlexFDO

Authors Leo Liberti, Nelson Maculan, S. Kucherenko

Publication date 29 May 2007

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2004.03.040

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Monte Carlo methods (65C05) Nonconvex programming, global optimization (90C26)

Recommendations

• New formulations for the Kissing Number Problem
• The kissing number in four dimensions
• A short solution of the kissing number problem in dimension three
• The problem of the twenty-five spheres
• A survey on the kissing numbers.

Cites work

• Application of deterministic low-discrepancy sequences in global optimization
• Global optimization
• Reformulation and convex relaxation techniques for global optimization
• Sphere packings, lattices and groups. With additional contributions by E. Bannai, R. E. Borcherds, J. Leech, S. P. Norton, A. M. Odlyzko, R. A. Parker, L. Queen and B. B. Venkov.
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• The Problem of the Thirteen Spheres

Cited in

(5)

• New formulations for the Kissing Number Problem
• Packing unit spheres into a cube using VNS
• High-Accuracy Semidefinite Programming Bounds for Kissing Numbers
• Improving the Semidefinite Programming Bound for the Kissing Number by Exploiting Polynomial Symmetry
• A new filled function for global optimization

This page was built for publication: The Kissing Number Problem: A New Result from Global Optimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3439154)