Analysis of algorithms for a class of continuous partition problems

DOI10.1007/BF02366365zbMath0911.90241OpenAlexW1970766790MaRDI QIDQ1842452

E. M. Kiseleva, Naum Z. Shor

Publication date: 17 May 1995

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

Full work available at URL: https://doi.org/10.1007/bf02366365

zbMATH Keywords

covering problems\(r\)-algorithmnonsmooth objective functioncontinuous optimal set partitioninfinite-dimensional integer programming

Mathematics Subject Classification ID

Integer programming (90C10) Continuous location (90B85) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items (3)

A continuous problem of optimal partition with a nondifferentiable functional ⋮ Solution of continuous problems of optimal covering with spheres using optimal set-partition theory ⋮ Application of the theory of optimal set partitioning for constructing fuzzy Voronoi diagrams

Cites Work

• The Optimal Arrangement of Producers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Analysis of algorithms for a class of continuous partition problems