Solving sequential interval cutting problems via dynamic programming

DOI10.1016/0377-2217(92)90344-9MaRDI QIDQ1197666zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
• One-dimensional cutting stock problems and solution procedures
• An Optimum Solution for One-Dimensional Slitting Problems: A Dynamic Programming Approach
• Procedures for solving a 1-dimensional cutting problem
• Alternative approaches for one-dimensional slitting problems

Cites work

• A typology of cutting and packing problems
• scientific article; zbMATH DE number 3126094 (Why is no real title available?)
• scientific article; zbMATH DE number 4074379 (Why is no real title available?)
• scientific article; zbMATH DE number 3286662 (Why is no real title available?)

Cited in

(7)

• Stability analysis for a special interval cutting problem
• Cutting aluminium coils with high length variabilities
• A new dynamic programming procedure for three-staged cutting patterns
• Roll cutting in the curtain industry, or: a well-solvable allocation problem
• scientific article; zbMATH DE number 4211809 (Why is no real title available?)
• Alternative approaches for one-dimensional slitting problems
• The solution of packing problems with pieces variable length and additional allocation constraints

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

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