On reserve and double covering problems for the sets with non-Euclidean metrics
DOI10.2298/YJOR171112010LzbMATH Open1474.52021WikidataQ130125226 ScholiaQ130125226MaRDI QIDQ3388412FDOQ3388412
Authors: Quang Mung le, Anna Anan'evna Lempert, Alexandr Leonidovich Kazakov 
Publication date: 5 May 2021
Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)
Recommendations
- On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
- Optimization of multiple covering of a bounded set with circles
- On covering bounded sets by collections of circles of various radii
- Algorithms of optimal covering of 2D sets with dynamical metrics
- Algorithms for constructing optimal \(n\)-networks in metric spaces
Huygens principlewave frontcomputational experimentdouble coveringnon-Euclidean metriccovering problemFermat principlereserve covering
Transportation, logistics and supply chain management (90B06) Symmetry properties of polytopes (52B15) Discrete location and assignment (90B80)
Cites Work
- Optimization of multiple covering of a bounded set with circles
- On segmenting logistical zones for servicing continuously developed consumers
- A computational algorithm for optimally covering a plane region
- An approach to optimization in transport logistics
- Covering a rectangle with six and seven circles
- Mathematical model and program system for solving a problem of logistic objects placement
- Black box maximization of circular coverage
- Heuristic procedures for the m-partial cover problem on a plane
- Covering a rectangle with equal circles
- Covering a planar domain with sets of small diameter
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
- Optimal circle covering problems and their applications
- An electromagnetism metaheuristic for the unicost set covering problem
- Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
- The two-dimensional eikonal equation
- Covering a square by equal circles
- Covering a compact polygonal set by identical circles
- A continuous set covering problem as a quasidifferentiable optimization problem
- Sensor networks and covering of plane by discs
- A Genetic Algorithm for the Set Covering Problem
- Covering a planar region by randomly distributed sensors
- Efficient band monitoring with sensors outer positioning
Cited In (6)
- On covering of cylindrical and conical surfaces with equal balls
- Algorithms of optimal covering of 2D sets with dynamical metrics
- Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii
- On multiple coverings of fixed size containers with non-Euclidean metric by circles of two types
- Methods of optimization of Hausdorff distance between convex rotating figures
- On covering bounded sets by collections of circles of various radii
This page was built for publication: On reserve and double covering problems for the sets with non-Euclidean metrics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3388412)
