Solution of continuous problems of optimal covering with spheres using optimal set-partition theory

DOI10.1007/s10559-009-9113-5zbMath1182.49045OpenAlexW1972475259MaRDI QIDQ1040406

E. M. Kiseleva, E. V. Timoshenko, L. I. Lozovskaya

Publication date: 24 November 2009

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-009-9113-5

zbMATH Keywords

optimal partitionmetricsShor's \(r\)-algorithmoptimal coveringDirichlet-Voronoi diagramminimum radius of covering spheres

Mathematics Subject Classification ID

Related Items (5)

Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization ⋮ Theory of continuous optimal set partitioning problems as a universal mathematical formalism for constructing Voronoi diagrams and their generalizations. I. Theoretical foundations ⋮ Configuration space of geometric objects ⋮ Solving a two-stage continuous-discrete problem of optimal partition-allocation with a given position of the centers of subsets ⋮ Formalizing spatial configuration optimization problems with the use of a special function class

Cites Work

• Modified \(r\)-algorithm to find the global minimum of polynomial functions
• Analysis of algorithms for a class of continuous partition problems
• A continuous set covering problem as a quasidifferentiable optimization problem
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solution of continuous problems of optimal covering with spheres using optimal set-partition theory