Optimization of multiple covering of a bounded set with circles

DOI10.1134/S0965542510040135zbMATH Open1224.52026MaRDI QIDQ2995902FDOQ2995902

Authors: Sh. I. Galiev, M. A. Karpova 

Publication date: 4 May 2011

Published in: Computational Mathematics and Mathematical Physics (Search for Journal in Brave)

Recommendations

• On covering bounded sets by collections of circles of various radii
• Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
• Algorithms of optimal set covering on the planar R^2
• scientific article; zbMATH DE number 1522573
• Optimal circle covering problems and their applications

zbMATH Keywords

numerical methodsminimal coveringcovering with circlesoptimization of multiple covering

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Cited In (28)

• Optimizing the perimeter and the area of convex sets with fixed diameter and circumradius
• Optimization of the Hausdorff distance between sets in Euclidean space
• An algorithm for maximising covered area
• On the number and arrangement of sensors for the multiple covering of bounded plane domains
• On reserve and double covering problems for the sets with non-Euclidean metrics
• Optimization of the number and arrangement of circles of two radii for forming a \(k\)-covering of a bounded set
• Title not available (Why is that?)
• Computational algorithms for the optimum covering of plane domains by a prescribed number of ellipses
• A continuous set covering problem as a quasidifferentiable optimization problem
• Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices
• Optimal circle covering problems and their applications
• Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii
• Optimal covering of plane domains by circles via hyperbolic smoothing
• Title not available (Why is that?)
• Approximating sets on a plane with optimal sets of circles
• Covering a compact polygonal set by identical circles
• On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
• Bounds on the optimal radius when covering a set with minimum radius identical disks
• Solution of continuous problems of optimal covering with spheres using optimal set-partition theory
• Solving continuous set covering problems by means of semi-infinite optimization. With an application in product portfolio optimization
• Algorithms for constructing optimal \(n\)-networks in metric spaces
• Algorithms of the best approximations of the flat sets by the union of circles
• Optimal covering points and related problems
• Nearly optimal coverings of a sphere with generalized spherical segments
• Algorithms and Data Structures
• On covering bounded sets by collections of circles of various radii
• Title not available (Why is that?)
• A branch-and-bound approach for estimating covering functionals of convex bodies

Uses Software

• J-MEANS

This page was built for publication: Optimization of multiple covering of a bounded set with circles

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