Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary
From MaRDI portal
Publication:5090167
DOI10.33048/daio.2020.27.678OpenAlexW4246214567MaRDI QIDQ5090167
A. A. Uspenskii, V. N. Ushakov, Pavel Dmitrievich Lebedev
Publication date: 15 July 2022
Published in: Diskretnyi analiz i issledovanie operatsii (Search for Journal in Brave)
Full work available at URL: http://mathnet.ru/eng/da1267
optimizationalgorithmapproximationpackingnumerical proceduredirectional derivativemaximizationsuperdifferentialsupergradient ascent
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An intelligent management system for the development of a regional transport logistics infrastructure
- An estimate of the stability defect for a positional absorption set subjected to discriminant transformations
- Method of conjugate subgradients with constrained memory
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Approximate algorithms for constrained circular cutting problems
- Packing equal circles in a square: A deterministic global optimization approach
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- A study of maximum unit-circle caterpillars---tools for the study of the shape of adsorption patterns
- Approximating sets on a plane with optimal sets of circles
- High-resolution EM attacks against leakage-resilient PRFs explained and an improved construction
- Dense packing of congruent circles in free-form non-convex containers
- Algorithms of Optimal Packing Construction in Ellipse
- Convex Analysis
This page was built for publication: Numerical methods for constructing suboptimal packings of nonconvex domains with curved boundary