Global optimization for the three-dimensional open-dimension rectangular packing problem

DOI10.1080/0305215X.2017.1411484OpenAlexW2780079250MaRDI QIDQ5058800

No author found.

Publication date: 23 December 2022

Published in: Engineering Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0305215x.2017.1411484

zbMATH Keywords

global optimizationexact methodmixed-integer linear programrectangular packing problem

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Related Items (1)

An effective logarithmic formulation for piecewise linearization requiring no inequality constraint

Cites Work

• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• Three-dimensional bin packing problem with variable bin height
• An analytical model for the container loading problem
• A global optimization algorithm for the three-dimensional packing problem
• MIP-based approaches for the container loading problem with multi-drop constraints
• Three-dimensional container loading models with cargo stability and load bearing constraints
• A comparative evaluation of heuristics for container loading
• Heuristics for the container loading problem
• Solving container loading problems by block arrangement
• Constraints in container loading -- a state-of-the-art review
• An improved typology of cutting and packing problems
• An efficient deterministic optimization approach for rectangular packing problems
• A global optimization approach for solving three-dimensional open dimension rectangular packing problems
• On Three-Dimensional Packing
• Heuristic algorithms for on-line packing in three dimensions
• Optimization Models for the Three-Dimensional Container Loading Problem with Practical Constraints

This page was built for publication: Global optimization for the three-dimensional open-dimension rectangular packing problem