Packing different-sized circles into a rectangular container
From MaRDI portal
(Redirected from Publication:1127229)
Recommendations
- A heuristic for the circle packing problem with a variety of containers
- Integer programming formulations for approximate packing circles in a rectangular container
- Proportional packing of circles in a circular container
- Packing circular-like objects in a rectangular container
- Recursive circle packing problems
Cites work
- scientific article; zbMATH DE number 3945878 (Why is no real title available?)
- scientific article; zbMATH DE number 20220 (Why is no real title available?)
- scientific article; zbMATH DE number 3497315 (Why is no real title available?)
- scientific article; zbMATH DE number 194544 (Why is no real title available?)
- A family of genetic algorithms for the pallet loading problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Complexity results for scheduling chains on a single machine
- Cutting stock problems and solution procedures
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- Integrated container loading software for pulp and paper industry
- Optimising the palletisation of cylinders in cases
- Packing problems
Cited in
(49)- A heuristic for the circle packing problem with a variety of containers
- A mathematical model and a solution method for the problem of placing various-sized circles into a strip
- A simulated annealing approach for the circular cutting problem
- An algorithm to construct conformable tubular networks that occupy arbitrary regions in \(\mathbb{R}^3\)
- Optimizing the packing of cylinders into a rectangular container: A nonlinear approach
- A dynamic adaptive local search algorithm for the circular packing problem
- Solving circle packing problems by global optimization: numerical results and industrial applications
- A local search-based method for sphere packing problems
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- Approximate algorithms for constrained circular cutting problems
- Mixed-integer DC programming based algorithms for the circular packing problem
- Efficient approaches for furnace loading of cylindrical parts
- Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches
- Metaheuristics: A bibliography
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Annealing, Cylinder Packing By Simulated
- A probability collectives approach for multi-agent distributed and cooperative optimization with tolerance for agent failure
- A beam search algorithm for the circular packing problem
- Cutting circles and polygons from area-minimizing rectangles
- A memetic algorithm to pack unequal circles into a square
- Packing non-identical circles within a rectangle with open length
- Proportional packing of circles in a circular container
- Greedy algorithms for packing unequal spheres into a cuboidal strip or a cuboid
- An improved typology of cutting and packing problems
- Effective methods for a container packing operation
- Valid constraints for the Point Packing in a Square problem
- A dual-response forwarding approach for containerizing air cargoes under uncertainty, based on stochastic mixed 0-1 programming
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- Integer programming formulations for approximate packing circles in a rectangular container
- A family of genetic algorithms for the pallet loading problem
- Applying genetic algorithms and neural networks to the container loading problem
- Recursive circle packing problems
- A bi-objective guillotine cutting problem of stamping strips of equal circles
- A formulation space search heuristic for packing unequal circles in a fixed size circular container
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- A literature review on circle and sphere packing problems: models and methodologies
- An improved algorithm for the packing of unequal circles within a larger containing circle
- Packing circular-like objects in a rectangular container
- Polynomial-time approximation schemes for circle and other packing problems
- Packing unequal spheres into various containers
- Packing unequal circles into a strip of minimal length with a jump algorithm
- High density packings of equal circles in rectangles with variable aspect ratio
- An action-space-based global optimization algorithm for packing circles into a square container
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
- Column enumeration based decomposition techniques for a class of non-convex MINLP problems
- A model to design recreational boat mooring fields
- PERM for solving circle packing problem
- Simplest optimal guillotine cutting patterns for strips of identical circles
This page was built for publication: Packing different-sized circles into a rectangular container
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1127229)
