Bounds for Two-Dimensional Cutting
From MaRDI portal
Publication:3221736
DOI10.2307/2582079zbMath0557.90046OpenAlexW4254177611MaRDI QIDQ3221736
Publication date: 1985
Published in: The Journal of the Operational Research Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2582079
Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Boolean programming (90C09)
Related Items (9)
The geometry of nesting problems: a tutorial ⋮ An improved typology of cutting and packing problems ⋮ Rectangle blanket problem: binary integer linear programming formulation and solution algorithms ⋮ Packing problems ⋮ LP bounds in various constraint programming approaches for orthogonal packing ⋮ Queue-constrained packing: a vehicle ferry case study ⋮ The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem ⋮ One-dimensional relaxations and LP bounds for orthogonal packing ⋮ An algorithm for the 2D guillotine cutting stock problem
This page was built for publication: Bounds for Two-Dimensional Cutting
