Robust Designs for Circle Coverings of a Square
From MaRDI portal
Publication:4634980
DOI10.1007/978-3-319-18899-7_11zbMath1390.90449MaRDI QIDQ4634980
Publication date: 13 April 2018
Published in: Optimized Packings with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-18899-7_11
uncertainty; global optimization; interval arithmetic; robust design; circle covering; complete search; sensor network deployment; black box search
65K05: Numerical mathematical programming methods
90C26: Nonconvex programming, global optimization
90C30: Nonlinear programming
65G30: Interval and finite arithmetic
52C15: Packing and covering in (2) dimensions (aspects of discrete geometry)
Cites Work
- Unnamed Item
- Unnamed Item
- Bound constrained interval global optimization in the COCONUT environment
- Covering a rectangle with equal circles
- Improved coverings of a square with six and eight equal circles
- An interval method to validate optimal solutions of the ``packing circles in a unit square problems
- Location of cross-docking centers and vehicle routing scheduling under uncertainty: a fuzzy possibilistic-stochastic programming model
- Clouds, fuzzy sets, and probability intervals
- Covering a square by equal circles
- Potential based clouds in robust design optimization
- Nonlinearly Constrained Optimization Using Heuristic Penalty Methods and Asynchronous Parallel Generating Set Search
- Interval Methods for Systems of Equations
- Complete search in continuous global optimization and constraint satisfaction