A computational algorithm for optimally covering a plane region-Reference-Cited by-同舟云学术

A computational algorithm for optimally covering a plane region

Published:1971-01 Issue:2 Volume:11 Page:17-27
ISSN:0041-5553
Container-title:USSR Computational Mathematics and Mathematical Physics
language:en
Short-container-title:USSR Computational Mathematics and Mathematical Physics

Author:

Brusov V.S.,Piyavskii S.A.

Publisher

Elsevier BV

Subject

General Engineering

Reference5 articles.

1. Optimization of networks;Piyavskii;Izv. Akad. Nauk SSSR, Tekhn, kibernetika,1968

2. Application of the theory of optimal coverings to the selection of a low-thrust space vehicle motor;Brusov;Inzh. zh. Mekhan. tverdogo tela,1968

3. Application of the theory of optimal coverings to problems of low-thrust motor power selection;Brusov;Izv. Akad. Nauk. SSSR, Mekhan. tverdogo tela,1969

4. A low-thrust motor which is universal for a two-dimensional band;Brusov;Izv. Akad. Nauk. SSSR, Kosmich. issled,1970

5. Sufficient conditions for optimality in optimal covering problems;Krotov;Izv. Akad. Nauk. SSSR, Tekhn. kibernetika,1968

Cited by 11 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Algorithms for Constructing Optimal Covering of Planar Figures with Disks Sets of Linearly Different Radii;The Bulletin of Irkutsk State University. Series Mathematics;2023

2. Optimization of a k-covering of a bounded set with circles of two given radii;Open Computer Science;2021-01-01

3. Advanced “Confident Judgments” Method when Choosing Multicriteria Solutions in a Multipurpose Approach;Journal of Computer and Systems Sciences International;2020-01

4. On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types;Mathematical Optimization Theory and Operations Research;2020

5. Iterative Methods for Constructing Approximations to Optimal Coverings of Nonconvex Polygons;Mathematical Optimization Theory and Operations Research;2019