On determining the cover of a simplex by spheres centered at its vertices

DOI10.1007/S10898-010-9524-XMaRDI QIDQ645552zbMATHOpenAlexFDO

Authors L. G. Casado, I. García, Boglárka G.-Tóth, E. M. T. Hendrix

Publication date 8 November 2011

Published in Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10898-010-9524-x

zbMATH Keywords

simplexcoveringspheres

Mathematics Subject Classification ID

Convex programming (90C25)

Recommendations

• Covering a simplex by spheres: complexity and algorithms
• On optimal disc covers and a new characterization of the Steiner center
• Covering a convex 3D polytope by a minimal number of congruent spheres
• A method of covering a convex polyhedral region by a minimal number of congruent spheres
• A new simplicial cover technique in constrained global optimization

Cites work

• An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane
• Infeasibility spheres for finding robust solutions of blending problems with quadratic constraints
• The semi-continuous quadratic mixture design problem: description and branch-and-bound approach

Cited in

(7)

• Globally-biased disimpl algorithm for expensive global optimization
• On optimal disc covers and a new characterization of the Steiner center
• Covering a simplex by spheres: complexity and algorithms
• Optimal circle covering problems and their applications
• On refinement of the unit simplex using regular simplices
• Rounding on the standard simplex: regular grids for global optimization
• Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants

This page was built for publication: On determining the cover of a simplex by spheres centered at its vertices

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