Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model

DOI10.1016/J.COR.2024.106651MaRDI QIDQ6568471zbMATH OpenFDO

Authors Mateus Martin, Thiago Alves de Queiroz, Reinaldo Morabito

Publication date 8 July 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106651

zbMATH Keywords

constraint programmingcutting and packingthree-dimensional rectangular packingopen-dimension problems

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A Branch-and-Repair Method for Three-Dimensional Bin Selection and Packing in E-Commerce
• A comparative review of 3D container loading algorithms
• A global optimization approach for solving three-dimensional open dimension rectangular packing problems
• An Algorithm for Two-Dimensional Cutting Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• An algorithm for the three-dimensional packing problem with asymptotic performance analysis
• An analytical model for the container loading problem
• An exact approach to the strip-packing problem
• An improved typology of cutting and packing problems
• Combinatorial Benders' cuts for the strip packing problem
• Constraints in container loading -- a state-of-the-art review
• Determining the best shipper sizes for sending products to customers
• Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems
• Exact solution techniques for two-dimensional cutting and packing
• Global optimization for the three-dimensional open-dimension rectangular packing problem
• Grids for cutting and packing problems: a study in the 2D knapsack problem
• Heuristic approaches for the two- and three-dimensional knapsack packing problem
• Logic based Benders' decomposition for orthogonal stock cutting problems
• On the \(L\)-approach for generating unconstrained two-dimensional non-guillotine cutting patterns
• Practical constraints in the container loading problem: comprehensive formulations and exact algorithm
• Reactive GRASP for the strip-packing problem
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• Strip based compact formulation for two-dimensional guillotine cutting problems
• The static stability of support factor‐based rectangular packings: an assessment by regression analysis
• Three-dimensional bin packing problem with variable bin height

Cited in

(3)

• Branch-and-repair for the stochastic three-dimensional bin selection problem: a multi-stage stochastic programming application
• A low-carbon resource-constrained project scheduling problem with limited three-dimensional workspaces and its hierarchical deep reinforcement learning approach
• A block-building constraint programming model for the container loading problem

This page was built for publication: Solving the three-dimensional open-dimension rectangular packing problem: a constraint programming model

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6568471)