Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting

DOI10.1016/J.COR.2023.106490MaRDI QIDQ6568431zbMATH OpenFDO

Authors Adriano Masone, Mauro Russo, Claudio Sterle

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.2023.106490

zbMATH Keywords

dynamic programmingparallelizationguillotine cutting

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• scientific article; zbMATH DE number 1131473 (Why is no real title available?)
• 2DPackLib: a two-dimensional cutting and packing library
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
• A cutting plane method and a parallel algorithm for packing rectangles in a circular container
• An Algorithm for Two-Dimensional Cutting Problems
• An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
• An improved typology of cutting and packing problems
• An introduction to the two‐dimensional rectangular cutting and packing problem
• An investigation of neural networks for linear time-series forecasting
• Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
• Exact solution techniques for two-dimensional cutting and packing
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• The G4-Heuristic for the Pallet Loading Problem
• The Theory and Computation of Knapsack Functions
• Two-dimensional packing problems: a survey
• Using GPU computing for solving the two-dimensional guillotine cutting problem

Cited in

(1)

• EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints

This page was built for publication: Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting

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