Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization
From MaRDI portal
Publication:2496055
DOI10.1016/j.cor.2005.03.031zbMath1110.90072OpenAlexW2108682989MaRDI QIDQ2496055
Ernesto G. Birgin, F. H. Nishihara, Débora P. Ronconi, José Mario Martínez
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.03.031
Related Items
Hybrid spectral gradient method for the unconstrained minimization problem, Packing ellipsoids by nonlinear optimization, Packing unequal rectangles and squares in a fixed size circular container using formulation space search, New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, A novel non-linear approach to minimal area rectangular packing, Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches, Symmetry-breaking constraints for packing identical rectangles within polyhedra, A heuristic approach for packing identical rectangles in convex regions, Phi-functions for 2D objects formed by line segments and circular arcs, Configuration space of geometric objects, Optimized Object Packings Using Quasi-Phi-Functions, Minimax optimal placement problem for special-form objects on a multiply connected domain, Minimizing the object dimensions in circle and sphere packing problems, Packing circles within ellipses, Mathematical model and efficient algorithms for object packing problem, Cutting circles and polygons from area-minimizing rectangles, Packing Problems in Space Solved by CPLEX: An Experimental Analysis, Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Reformulation descent applied to circle packing problems
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- An exact algorithm for the pallet loading problem
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Two-dimensional packing problems: a survey
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- Numerical comparison of augmented Lagrangian algorithms for nonconvex problems
- An approach to nonlinear programming
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- A note on an L-approach for solving the manufacturer's pallet loading problem
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- Spectral projected gradient and variable metric methods for optimization with linear inequalities
- A Polynomial Time Algorithm For The Guillotine Pallet Loading Problem
- Algorithm 813
