New formulations for the Kissing Number Problem

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

Pietro Belotti, Leo Liberti, Nelson F. Maculan, Sergei Kucherenko

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

NLP; global optimization; stochastic algorithm; variable neighbourhood search; sphere packing; multi-level single linkage

Mathematics Subject Classification ID

90C15: Stochastic programming

94B65: Bounds on codes

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

Related Items

Variable neighbourhood search: methods and applications, Variable neighbourhood search: Methods and applications

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