On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types

DOI10.1007/978-3-030-58657-7_12zbMath1460.90150OpenAlexW3086051796MaRDI QIDQ4965106

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

Publication date: 25 February 2021

Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-58657-7_12

zbMATH Keywords

logisticsmultiple coveringnon-Euclidean metriccircle covering problemincongruent circlesoptical-geometric approach

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items

Algorithms for constructing optimal covering of planar figures with disks sets of linearly different radii

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• 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
• An intelligent management system for the development of a regional transport logistics infrastructure
• Packing, covering and tiling in two-dimensional spaces
• An approach to optimization in transport logistics
• Efficient algorithm for placing a given number of base stations to cover a convex region
• A fast approximation algorithm for the multicovering problem
• Approximation algorithms for combinatorial problems
• A Lagrangian-based heuristic for large-scale set covering problems
• Thinnest covering of the Euclidean plane with incongruent circles
• On combinatorial approximation of covering 0-1 integer programs and partial set cover
• Covering the plane with two kinds of circles
• Solid coverings of the Euclidean plane with incongruent circles
• Optimization of multiple covering of a bounded set with circles
• Multiple covering of the plane by circles
• Black box maximization of circular coverage
• A Greedy Heuristic for the Set-Covering Problem
• Multiple packing and covering of the plane with circles
• A Genetic Algorithm for the Set Covering Problem
• A computational algorithm for optimally covering a plane region
• On the multiple packing densities of triangles