Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem

DOI10.1287/ijoc.1070.0233zbMath1243.90137OpenAlexW2068991409MaRDI QIDQ2901006

Mhand Hifi, Rym M'Hallah, Toufik Saadi

Publication date: 28 July 2012

Published in: INFORMS Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/ijoc.1070.0233

zbMATH Keywords

integer programmingcutting stockdeterministic dynamic programming

Mathematics Subject Classification ID

Integer programming (90C10) Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39)

Related Items (6)

Heuristic for constrained T-shape cutting patterns of rectangular pieces ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems ⋮ Efficient algorithms for the offline variable sized bin-packing problem ⋮ A hybrid beam search looking-ahead algorithm for the circular packing problem ⋮ Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns

This page was built for publication: Algorithms for the Constrained Two-Staged Two-Dimensional Cutting Problem