A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems

DOI10.1007/BF01720208zbMath0642.90051OpenAlexW2068499768MaRDI QIDQ1101337

Hartmut Stadtler

Publication date: 1988

Published in: OR Spektrum (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01720208

zbMATH Keywords

optimal solutioncutting stockcomplete-cut LP-modelreduction-rules

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Integer programming (90C10) Linear programming (90C05) Production models (90B30)

Related Items (12)

A note on handling residual lengths ⋮ Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Solution approaches for the cutting stock problem with setup cost ⋮ Heuristics for the integer one-dimensional cutting stock problem: A computational study ⋮ Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model ⋮ Knowledge based approach to the cutting stock problem ⋮ A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems ⋮ Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application ⋮ A one-dimensional cutting stock problem in the aluminium industry and its solution ⋮ A typology of cutting and packing problems ⋮ LP models for bin packing and cutting stock problems ⋮ Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths

Uses Software

• LINDO

Cites Work

• Unnamed Item
• Unnamed Item
• Near-optimal solutions to one-dimensional cutting stock problems
• The trim-loss and assortment problems: A survey
• A Linear Programming Approach to the Cutting-Stock Problem
• A New Linear Programming Approach to the Cutting Stock Problem
• The simplex SON algorithm for LP/embedded network problems
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems