A deterministic global optimization algorithm for the Thomson and Tammes problems

DOI10.1016/J.DAM.2026.05.015MaRDI QIDQ7289259zbMATH OpenFDO

Authors Anatoliy Kuznetsov, Nikolaos V. Sahinidis

Publication date 2 July 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2026.05.015

Mathematics Subject Classification ID

Optimization problems in optics and electromagnetic theory (78M50) Nonconvex programming, global optimization (90C26) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Cites work

• A computational comparison of symmetry handling methods for mixed integer programs
• BARON: A general purpose global optimization software package
• Bounds tightening based on optimality conditions for nonconvex box-constrained optimization
• Complexity of Bezout's theorem. III: Condition number and packing
• Estimating the number of stable configurations for the generalized Thomson problem
• Formulation symmetries in circle packing
• Geometrical problems related to crystals, fullerenes, and nanoparticle structure
• scientific article; zbMATH DE number 432979 (Why is no real title available?)
• scientific article; zbMATH DE number 3859887 (Why is no real title available?)
• Mathematical problems for the next century
• MINLPLib -- a collection of test models for mixed-integer nonlinear programming
• More optimal packings of equal circles in a square
• Multisymmetric close packings of equal spheres on the spherical surface
• New formulations for the Kissing Number Problem
• On Cading and Information Theory
• On the impact of symmetry-breaking constraints on spatial branch-and-bound for circle packing in a square
• On the structure of the atom: an investigation of the stability and periods of oscillation of a number of corpuscles arranged at equal intervals around the circumference of a circle; with application of the results to the theory of atomic structure.
• Packing equal circles in a square: A deterministic global optimization approach
• Pyomo -- optimization modeling in Python
• Safe bounds in linear and mixed-integer linear programming
• Stabilizer-based symmetry breaking constraints for mathematical programs
• Symmetry in mathematical programming
• The Five-Electron Case of Thomson’s Problem
• The Tammes problem for N = 14
• Three enhancements for optimization-based bound tightening
• Universally optimal distribution of points on spheres

This page was built for publication: A deterministic global optimization algorithm for the Thomson and Tammes problems

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