On reserve and double covering problems for the sets with non-Euclidean metrics

DOI10.2298/YJOR171112010LzbMath1474.52021WikidataQ130125226 ScholiaQ130125226MaRDI QIDQ3388412

Quang Mung le, Anna Anan'evna Lempert, Aleksandr Leonidovich Kazakov

Publication date: 5 May 2021

Published in: Yugoslav Journal of Operations Research (Search for Journal in Brave)

zbMATH Keywords

wave frontHuygens principlecomputational experimentdouble coveringnon-Euclidean metriccovering problemFermat principlereserve covering

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80) Symmetry properties of polytopes (52B15)

Related Items (3)

Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii ⋮ Methods of optimization of Hausdorff distance between convex rotating figures ⋮ On covering bounded sets by collections of circles of various radii

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical model and program system for solving a problem of logistic objects placement
• Optimal circle covering problems and their applications
• Algorithms for the construction of an optimal cover for sets in three-dimensional Euclidean space
• On segmenting logistical zones for servicing continuously developed consumers
• An approach to optimization in transport logistics
• Covering a compact polygonal set by identical circles
• An electromagnetism metaheuristic for the unicost set covering problem
• Heuristic procedures for the m-partial cover problem on a plane
• Covering a rectangle with equal circles
• Covering a square by equal circles
• Covering a rectangle with six and seven circles
• Covering a planar domain with sets of small diameter
• Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
• Optimization of multiple covering of a bounded set with circles
• A continuous set covering problem as a quasidifferentiable optimization problem
• Black box maximization of circular coverage
• A Genetic Algorithm for the Set Covering Problem
• A computational algorithm for optimally covering a plane region
• Efficient band monitoring with sensors outer positioning

This page was built for publication: On reserve and double covering problems for the sets with non-Euclidean metrics