Solving sequential interval cutting problems via dynamic programming

DOI10.1016/0377-2217(92)90344-9zbMath0761.90083OpenAlexW1989133164MaRDI QIDQ1197666

Knut Richter

Publication date: 16 January 1993

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(92)90344-9

zbMATH Keywords

cutting stocksequential one-dimensional cutting

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Production models (90B30) Combinatorial optimization (90C27) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Related Items (3)

Cutting aluminium coils with high length variabilities ⋮ Stability analysis for a special interval cutting problem ⋮ The solution of packing problems with pieces variable length and additional allocation constraints

Cites Work

• A typology of cutting and packing problems
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Solving sequential interval cutting problems via dynamic programming