New formulations for the Kissing Number Problem

DOI10.1016/j.dam.2006.05.012zbMath1144.90455OpenAlexW2040125033WikidataQ59594758 ScholiaQ59594758MaRDI QIDQ2383541

Pietro Belotti, Leo Liberti, Sergei Kucherenko, Nelson F. 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

NLPglobal optimizationstochastic algorithmvariable neighbourhood searchsphere packingmulti-level single linkage

Mathematics Subject Classification ID

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

Related Items

Symmetry in Mathematical Programming ⋮ 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 ⋮ Variable neighbourhood search: methods and applications ⋮ Unnamed Item ⋮ Variable neighbourhood search: Methods and applications ⋮ Packing Unit Spheres into a Cube Using VNS

Uses Software

• SNOPT

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Validation of an augmented Lagrangian algorithm with a Gauss-Newton Hessian approximation using a set of hard-spheres problems
• The kissing number in four dimensions
• Application of deterministic low-discrepancy sequences in global optimization
• The Problem of the Thirteen Spheres
• Stochastic global optimization methods part I: Clustering methods
• Stochastic global optimization methods part II: Multi level methods
• Global optimization
• Variable neighborhood search: Principles and applications