Robust Designs for Circle Coverings of a Square

DOI10.1007/978-3-319-18899-7_11zbMath1390.90449OpenAlexW2239589052MaRDI QIDQ4634980

Mihály Csaba Markót

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

zbMATH Keywords

uncertaintyglobal optimizationinterval arithmeticrobust designcircle coveringcomplete searchsensor network deploymentblack box search

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30) Interval and finite arithmetic (65G30) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

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

This page was built for publication: Robust Designs for Circle Coverings of a Square