The two-dimensional cutting stock problem within the roller blind production process

DOI10.1111/J.1467-9574.2009.00436.XMaRDI QIDQ6573721

E. R. de Gelder, Albert P. M. Wagelmans

Publication date: 17 July 2024

Published in: Statistica Neerlandica (Search for Journal in Brave)

zbMATH Keywords

cuttingtwo-dimensional cutting stock problemtrim loss

Mathematics Subject Classification ID

Mathematical programming (90Cxx) Operations research and management science (90Bxx) Operations research, mathematical programming (90-XX)

Cites Work

• Cutting and packing. Special issue
• Heuristic and exact methods for the cutting sequencing problem
• A typology of cutting and packing problems
• LP models for bin packing and cutting stock problems
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• An improved typology of cutting and packing problems
• A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• A Note on the Two-Dimensional Rectangular Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• Multistage Cutting Stock Problems of Two and More Dimensions
• Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems

This page was built for publication: The two-dimensional cutting stock problem within the roller blind production process

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