Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
From MaRDI portal
Publication:1887860
DOI10.1016/j.ejor.2003.06.018zbMath1067.90133OpenAlexW1986491462MaRDI QIDQ1887860
Ernesto G. Birgin, Débora P. Ronconi, José Mario Martínez
Publication date: 22 November 2004
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2003.06.018
Nonlinear programmingBound-constrained minimizationCircular containerConvex-constrained minimizationCylinder packingRectangular container
Related Items
Hybrid spectral gradient method for the unconstrained minimization problem, Packing ellipsoids by nonlinear optimization, Modeling close packing of 3D objects, The disruptive anti-covering location problem, Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container, An improved typology of cutting and packing problems, An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container, A memetic algorithm to pack unequal circles into a square, High density packings of equal circles in rectangles with variable aspect ratio, Models and algorithms for packing rectangles into the smallest square, Packing non-identical circles within a rectangle with open length, A new heuristic algorithm for the circular packing problem with equilibrium constraints, New and improved results for packing identical unitary radius circles within triangles, rectangles and strips, A nonlinear programming model with implicit variables for packing ellipsoids, A literature review on circle and sphere packing problems: models and methodologies, On the use of third-order models with fourth-order regularization for unconstrained optimization, An efficient method for the three-dimensional container loading problem by forming box sizes, Approximation schemes for covering and packing problems in image processing and VLSI, A heuristic approach for packing identical rectangles in convex regions, Integer programming formulations for approximate packing circles in a rectangular container, Improving ultimate convergence of an augmented Lagrangian method, Solving circle packing problems by global optimization: numerical results and industrial applications, Consideration of triple bottom line objectives for sustainability in the optimization of vehicle routing and loading operations: a systematic literature review, Optimized Object Packings Using Quasi-Phi-Functions, Adaptive beam search lookahead algorithms for the circular packing problem, Packing identical spheres into a cylinder, Irreducible bin packing and normality in routing open shop, Minimizing the object dimensions in circle and sphere packing problems, Damped Arrow-Hurwicz algorithm for sphere packing, Augmented Lagrangians with constrained subproblems and convergence to second-order stationary points, A beam search algorithm for the circular packing problem, Adaptive and restarting techniques-based algorithms for circular packing problems, Packing circles within ellipses, Global optimization method for finding dense packings of equal circles in a circle, A hybrid beam search looking-ahead algorithm for the circular packing problem, Orthogonal packing of rectangular items within arbitrary convex regions by nonlinear optimization, Maximizing the sum of radii of balls inscribed in a polyhedral set, Adaptive large neighborhood search for solving the circle bin packing problem, Recursive circle packing problems, Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization, Packing cylinders and rectangular parallelepipeds with distances between them into a given region, A support tool for planning classrooms considering social distancing between students, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, Mathematical Models of Placement Optimisation: Two- and Three-Dimensional Problems and Applications, 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
- Optimising the palletisation of cylinders in cases
- Packing different-sized circles into a rectangular container
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- Estimation of the optimal constants and the thickness of thin films using unconstrained optimization
- Integrated container loading software for pulp and paper industry
- Dense packings of congruent circles in a circle
- Large-scale active-set box-constrained optimization method with spectral projected gradients
- An approach to nonlinear programming
- A New Upper Bound for the Cylinder Packing Problem
- A More Portable Fortran Random Number Generator
- Nonmonotone Spectral Projected Gradient Methods on Convex Sets
- Cylinder packing by simulated annealing
- Algorithm 813
