New formulations for the Kissing Number Problem

DOI10.1016/J.DAM.2006.05.012MaRDI QIDQ2383541zbMATH OpenOpenAlexWikidataFDO

Authors Pietro Belotti, Leo Liberti, S. Kucherenko, Nelson Maculan

Publication date 19 September 2007

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2006.05.012

zbMATH Keywords

global optimizationmulti-level single linkageNLPsphere packingstochastic algorithmvariable neighbourhood search

Mathematics Subject Classification ID

Packing and covering in (n) dimensions (aspects of discrete geometry) (52C17) Stochastic programming (90C15) Bounds on codes (94B65)

Recommendations

• The Kissing Number Problem: A New Result from Global Optimization
• The kissing number in four dimensions
• New upper bounds for kissing numbers from semidefinite programming
• A short solution of the kissing number problem in dimension three
• A survey on the kissing numbers.

Cites work

• Application of deterministic low-discrepancy sequences in global optimization
• Global optimization
• scientific article; zbMATH DE number 108350 (Why is no real title available?)
• scientific article; zbMATH DE number 2010047 (Why is no real title available?)
• scientific article; zbMATH DE number 1857674 (Why is no real title available?)
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• The kissing number in four dimensions
• The Problem of the Thirteen Spheres
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
• Variable neighborhood search: Principles and applications

Cited in

(12)

• Variable neighbourhood search: Methods and applications
• Optimization and operations research in mitigation of a pandemic
• On an SDP relaxation for kissing number
• On the convergence analysis of a penalty algorithm for nonsmooth optimization and its performance for solving hard-sphere problems
• Packing unit spheres into a cube using VNS
• Formulation symmetries in circle packing
• Symmetry in mathematical programming
• The Kissing Number Problem: A New Result from Global Optimization
• The kissing problem: how to end a gathering when everyone kisses everyone else goodbye
• A deterministic global optimization algorithm for the Thomson and Tammes problems
• A note on the kissing numbers of superballs
• Variable neighbourhood search: methods and applications

Describes a project that uses

Uses Software

• SNOPT

This page was built for publication: New formulations for the Kissing Number Problem

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