New and improved results for packing identical unitary radius circles within triangles, rectangles and strips
From MaRDI portal
Publication:2655648
DOI10.1016/j.cor.2009.09.017zbMath1178.90283OpenAlexW1997548217MaRDI QIDQ2655648
Ernesto G. Birgin, Jan M. Gentil
Publication date: 25 January 2010
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2009.09.017
Related Items
Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium, Packing ellipsoids by nonlinear optimization, A formulation space search heuristic for packing unequal circles in a fixed size circular container, Polynomial-time approximation schemes for circle and other packing problems, High density packings of equal circles in rectangles with variable aspect ratio, A nonlinear programming model with implicit variables for packing ellipsoids, On the use of third-order models with fourth-order regularization for unconstrained optimization, A heuristic approach for packing identical rectangles in convex regions, A heuristic for the circle packing problem with a variety of containers, Integer programming formulations for approximate packing circles in a rectangular container, Packing unequal circles into a strip of minimal length with a jump algorithm, Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, Optimized packing multidimensional hyperspheres: a unified approach, Packing circular-like objects in a rectangular container, Packing circles within ellipses, Maximizing the sum of radii of balls inscribed in a polyhedral set, Recursive circle packing problems, A support tool for planning classrooms considering social distancing between students, Iterated dynamic thresholding search for packing equal circles into a circular container, Packing a fixed number of identical circles in a circular container with circular prohibited areas, Linear models for the approximate solution of the problem of packing equal circles into a given domain
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Packing up to 50 equal circles in a square
- Packing equal circles in a square: A deterministic global optimization approach
- Reformulation descent applied to circle packing problems
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- New results in the packing of equal circles in a square
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Augmented Lagrangian methods under the constant positive linear dependence constraint qualification
- Minimizing the object dimensions in circle and sphere packing problems
- Structured minimal-memory inexact quasi-Newton method and secant preconditioners for augmented Lagrangian optimization
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
- Method of sentinels for packing items within arbitrary convex regions
- On Augmented Lagrangian Methods with General Lower-Level Constraints
- Mathematical model and solution method of optimization problem of placement of rectangles and circles taking into account special constraints
- Computational Science - ICCS 2004
