Recommendations
Cites work
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Archimedean polyhedron structure yields a lower energy atomic cluster
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Cutting circles and polygons from area-minimizing rectangles
- Global minimization using an augmented Lagrangian method with variable lower-level constraints
- scientific article; zbMATH DE number 41859 (Why is no real title available?)
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- Minimizing the object dimensions in circle and sphere packing problems
- New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Packing congruent hyperspheres into a hypersphere
- Packing equal circles into a circle with circular prohibited areas
- Solving circle packing problems by global optimization: numerical results and industrial applications
- The Tunneling Algorithm for the Global Minimization of Functions
Cited in
(17)- Optimal packing of general ellipses in a circle
- A matheuristic approach with nonlinear subproblems for large-scale packing of ellipsoids
- A support tool for planning classrooms considering social distancing between students
- Repulsion-based p-dispersion with distance constraints in non-convex polygons
- Packing ovals in optimized regular polygons
- Packing ellipsoids in an optimized cylinder
- -functions of 2D objects with boundaries being second-order curves
- Cutting ellipses from area-minimizing rectangles
- Optimized ellipse packings in regular polygons
- A nonlinear programming model with implicit variables for packing ellipsoids
- Recursive circle packing problems
- Packing ellipsoids with overlap
- Packing ellipsoids by nonlinear optimization
- Algorithms of optimal packing construction in ellipse
- Approximation schemes under resource augmentation for knapsack and packing problems of hyperspheres and other shapes
- Global convergence of an augmented Lagrangian method for nonlinear programming via Riemannian optimization
- Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming
This page was built for publication: Packing circles within ellipses
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4924059)
