Bounds on polarization problems on compact sets via mixed integer programming

DOI10.1007/S00454-024-00635-ZMaRDI QIDQ7025755zbMATH OpenFDO

Authors Jan Rolfes, Robert Schüler, Marc C. Zimmermann

Publication date 19 February 2025

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1007/S00454-024-00635-Z

zbMATH Keywords

geometric optimizationmaximal polarizationmixed integer programmingpotentials

Mathematics Subject Classification ID

Discrete potential theory (31C20) Computational methods for problems pertaining to geometry (51-08) Mixed integer programming (90C11)

Cites work

• Asymptotics of discrete Riesz \(d\)-polarization on subsets of \(d\)-dimensional manifolds
• Chebyshev constants for the unit circle
• Convexity. An analytic viewpoint
• Covering compact metric spaces greedily
• Discrete energy on rectifiable sets
• Flavors of translative coverings
• On some covering problems in geometry
• On the sum of powered distances to certain sets of points on the circle
• Optimal discrete measures for Riesz potentials
• Polarization and covering on sets of low smoothness
• Polarization optimality of equally spaced points on the circle for discrete potentials
• Polarization problem on a higher-dimensional sphere for a simplex
• Riesz polarization inequalities in higher dimensions
• Semi-infinite programming, duality, discretization and optimality conditions†
• The sum of the distances to certain pointsets on the unit circle
• The sum of the distances to N points on a sphere
• Universally optimal distribution of points on spheres

This page was built for publication: Bounds on polarization problems on compact sets via mixed integer programming

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