Optimal circle covering problems and their applications
From MaRDI portal
Publication:302130
DOI10.1007/s10100-014-0362-7zbMath1339.52013OpenAlexW1979361827MaRDI QIDQ302130
Balázs Bánhelyi, Balázs L. Lévai, Endre Palatinus
Publication date: 4 July 2016
Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10100-014-0362-7
Numerical mathematical programming methods (65K05) Combinatorial optimization (90C27) General methods in interval analysis (65G40) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)
Related Items (7)
A goal programming model for two-stage COVID19 test sampling centers location-allocation problem ⋮ Algorithms for constructing suboptimal coverings of plane figures with disks in the class of regular lattices ⋮ Orientational variable-length strip covering problem: a branch-and-price-based algorithm ⋮ Editorial ⋮ On Multiple Coverings of Fixed Size Containers with Non-Euclidean Metric by Circles of Two Types ⋮ On reserve and double covering problems for the sets with non-Euclidean metrics ⋮ On covering bounded sets by collections of circles of various radii
Cites Work
- Unnamed Item
- Unnamed Item
- Nonlinear transformations for the simplification of unconstrained nonlinear optimization problems
- Quasi-physical global optimization method for solving the equal circle packing problem
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- On determining the cover of a simplex by spheres centered at its vertices
- Efficient algorithm for placing a given number of base stations to cover a convex region
- A computational comparison of some branch and bound methods for indefinite quadratic programs
- Covering a rectangle with equal circles
- Interval analysis: Theory and applications
- A new multisection technique in interval methods for global optimization
- A multidimensional branch-and-prune method for interval global optimization
- Covering a planar domain with sets of small diameter
- A verified optimization technique to locate chaotic regions of Hénon systems
- Conjecturally Optimal Coverings of an Equilateral Triangle with Up to 36 Equal Circles
- INTLAB implementation of an interval global optimization algorithm
- A Computer-Assisted Proof of $\Sigma_3$-Chaos in the Forced Damped Pendulum Equation
- New subinterval selection criteria for interval global optimization
This page was built for publication: Optimal circle covering problems and their applications
