Packing ovals in optimized regular polygons
From MaRDI portal
Publication:2173521
DOI10.1007/s10898-019-00824-8zbMath1441.90135arXiv1901.07056OpenAlexW2971868147WikidataQ127297600 ScholiaQ127297600MaRDI QIDQ2173521
Frank J. Kampas, Ignacio Castillo, János D. Pintér
Publication date: 23 April 2020
Published in: Journal of Global Optimization (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1901.07056
numerical test resultsmodel development using embedded Lagrange multipliersgeneralized ellipses (ovals, eggs)global-local nonlinear optimizationregular polygon containers
Related Items
Packing convex polygons in minimum-perimeter convex hulls, Model development and solver demonstrations using randomized test problems, Digital model of natural cores using geometric design
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- A Mathematical Theory of Communication
- Packing ellipsoids by nonlinear optimization
- Packing ellipsoids into volume-minimizing rectangular boxes
- A literature review on circle and sphere packing problems: models and methodologies
- Tools of mathematical modeling of arbitrary object packing problems
- A heuristic for the circle packing problem with a variety of containers
- New approaches to circle packing in a square. With program codes.
- Solving circle packing problems by global optimization: numerical results and industrial applications
- Packing problems
- How difficult is nonlinear optimization? A practical solver tuning approach, with illustrative results
- Optimal packing of general ellipses in a circle
- Globally optimized packings of non-uniform size spheres in \(\mathbb {R}^{d}\): a computational study
- Mathematical optimization approaches for facility layout problems: the state-of-the-art and future research directions
- Heuristic algorithms for the three-dimensional bin packing problem
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Cutting ellipses from area-minimizing rectangles
- Mathematical model and efficient algorithms for object packing problem
- Optimized ellipse packings in regular polygons
- Optimized packings with applications
- The geometry of nesting problems: a tutorial
- A nonlinear programming model with implicit variables for packing ellipsoids
- An improved typology of cutting and packing problems
- Packing Ellipsoids with Overlap
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- Order and disorder in energy minimization
- Solving Non-standard Packing Problems by Global Optimization and Heuristics
- Design and analysis of simulation experiments
- Computational Physics
