Optimising the palletisation of cylinders in cases
From MaRDI portal
Publication:807336
Cites work
Cited in
(18)- Convex maximization formulation of general sphere packing problem
- A simulated annealing approach for the circular cutting problem
- 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
- Adaptive and restarting techniques-based algorithms for circular packing problems
- New heuristics for packing unequal circles into a circular container
- Efficient approaches for furnace loading of cylindrical parts
- Packing different-sized circles into a rectangular container
- An effective hybrid algorithm for the problem of packing circles into a larger containing circle
- Annealing, Cylinder Packing By Simulated
- Integrated container loading software for pulp and paper industry
- Optimal control sphere packing problem
- Generating optimal multi-segment cutting patterns for circular blanks in the manufacturing of electric motors
- A support tool for planning classrooms considering social distancing between students
- An improved algorithm for the packing of unequal circles within a larger containing circle
- High density packings of equal circles in rectangles with variable aspect ratio
- Parallel greedy algorithms for packing unequal circles into a strip or a rectangle
This page was built for publication: Optimising the palletisation of cylinders in cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q807336)
