Optimized ellipse packings in regular polygons
From MaRDI portal
Publication:2329677
DOI10.1007/s11590-019-01423-yzbMath1430.90489OpenAlexW2933260104MaRDI QIDQ2329677
Ignacio Castillo, Frank J. Kampas, János D. Pintér
Publication date: 18 October 2019
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-019-01423-y
numerical resultsLGO solver suitemodel development using embedded Lagrange multipliersgeneral ellipse packings in regular polygonsglobal and local nonlinear optimizationrandom starting points and local search by ipopt
Related Items (8)
Wildfire burn scar encapsulation. Subsetting common spatial domains for post-wildfire debris flow predictions over the United States ⋮ A nonlinear programming model with implicit variables for packing ellipsoids ⋮ Packing ovals in optimized regular polygons ⋮ Packing ellipsoids in an optimized cylinder ⋮ Packing convex polygons in minimum-perimeter convex hulls ⋮ Model development and solver demonstrations using randomized test problems ⋮ Packing ellipses in an optimized convex polygon ⋮ On calculating the packing efficiency for embedding hexagonal and dodecagonal sensors in a circular container
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quasi-phi-functions and optimal packing of ellipses
- Packing ellipsoids by nonlinear optimization
- Integrated experimental design and nonlinear optimization to handle computationally expensive models under resource constraints
- Packing circular-like objects in a rectangular container
- Packing ellipsoids into volume-minimizing rectangular boxes
- A literature review on circle and sphere packing problems: models and methodologies
- New approaches to circle packing in a square. With program codes.
- Solving circle packing problems by global optimization: numerical results and industrial applications
- 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
- A polyhedral branch-and-cut approach to global optimization
- Global optimization in action. Continuous and Lipschitz optimization: algorithms, implementations and applications
- Benchmarking nonlinear optimization software in technical computing environments
- Cutting ellipses from area-minimizing rectangles
- Derivative-free optimization: a review of algorithms and comparison of software implementations
- Development and calibration of a currency trading strategy using global optimization
- A nonlinear programming model with implicit variables for packing ellipsoids
- Nonlinear optimization with GAMS /LGO
- Packing Ellipsoids with Overlap
- Numerical optimization methods for packing equal orthogonally oriented ellipses in a rectangular domain
- A model to design recreational boat mooring fields
- Optimized Object Packings Using Quasi-Phi-Functions
- A spring-embedding approach for the facility layout problem
- Global Optimization Toolbox for Maple: an introduction with illustrative applications
- Finding elliptic Fekete points sets: Two numerical solution approaches
- Globally optimized spherical point arrangements: Model variants and illustrative results
- A Logarithmic Barrier Approach To Solving The Dashboard Planning Problem
This page was built for publication: Optimized ellipse packings in regular polygons
