Integrated container loading software for pulp and paper industry
From MaRDI portal
Publication:1333536
DOI10.1016/0377-2217(94)90410-3zbMath0800.90656OpenAlexW2081874143MaRDI QIDQ1333536
John A. George, Hamish J. Fraser
Publication date: 15 September 1994
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(94)90410-3
Related Items
A simulated annealing approach for the circular cutting problem, Optimizing the packing of cylinders into a rectangular container: A nonlinear approach, An effective hybrid algorithm for the problem of packing circles into a larger containing circle, A memetic algorithm to pack unequal circles into a square, High density packings of equal circles in rectangles with variable aspect ratio, Packing different-sized circles into a rectangular container, Minimizing late deliveries in a truck loading problem, Packing disks into disks with optimal worst-case density, Parallel greedy algorithms for packing unequal circles into a strip or a rectangle, Approximation schemes for covering and packing problems in image processing and VLSI, Integer programming formulations for approximate packing circles in a rectangular container, Valid constraints for the Point Packing in a Square problem, Approximate algorithms for constrained circular cutting problems, Solving circle packing problems by global optimization: numerical results and industrial applications, Split packing: algorithms for packing circles with optimal worst-case density, Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting, PERM for solving circle packing problem, Packing circular-like objects in a rectangular container, Packing equal circles into a circle with circular prohibited areas, Efficient approaches for furnace loading of cylindrical parts, Adaptive and restarting techniques-based algorithms for circular packing problems, New heuristics for packing unequal circles into a circular container, Cylinder packing by simulated annealing, Unnamed Item, Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition), Convex maximization formulation of general sphere packing problem, Column enumeration based decomposition techniques for a class of non-convex MINLP problems, Cutting circles and polygons from area-minimizing rectangles, An efficient approach for the multi-pallet loading problem, An improved algorithm for the packing of unequal circles within a larger containing circle, Constraints in container loading -- a state-of-the-art review
Cites Work
- Unnamed Item
- Optimising the palletisation of cylinders in cases
- Heuristiken zur Lösung des zweidimensionalen Packproblems für Rundgefäße. (Heuristics for the solution of the two-dimensional packing problem for cylinders)
- Packing problems
- A typology of cutting and packing problems
- A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
