A New Upper Bound for the Cylinder Packing Problem
From MaRDI portal
Publication:2767745
DOI10.1111/1475-3995.00334zbMath0992.90056OpenAlexW2000511942MaRDI QIDQ2767745
No author found.
Publication date: 22 September 2002
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/1475-3995.00334
Related Items
Optimizing the packing of cylinders into a rectangular container: A nonlinear approach ⋮ An improved typology of cutting and packing problems ⋮ A literature review on circle and sphere packing problems: models and methodologies ⋮ Solving circle packing problems by global optimization: numerical results and industrial applications ⋮ A beam search algorithm for the circular packing problem ⋮ Adaptive and restarting techniques-based algorithms for circular packing problems ⋮ Large-scale unconstrained optimization using separable cubic modeling and matrix-free subspace minimization
