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

DOI10.1007/S10898-010-9524-XzbMath1228.90074OpenAlexW2158918349MaRDI QIDQ645552

Inmaculada F. García, Boglárka G.-Tóth, Eligius M. T. Hendrix, Leocadio G. Casado

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

coveringspheressimplex

Mathematics Subject Classification ID

Convex programming (90C25)

Related Items (6)

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

Cites Work

• 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
• An efficient algorithm for construction of the power diagram from the voronoi diagram in the plane

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