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

DOI10.1007/BF01720208zbMATH Open0642.90051OpenAlexW2068499768MaRDI QIDQ1101337FDOQ1101337

Authors: 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

Recommendations

• Near-optimal solutions to one-dimensional cutting stock problems
• scientific article; zbMATH DE number 1050896
• Cutting stock problems and solution procedures
• One-dimensional cutting stock problems and solution procedures
• scientific article; zbMATH DE number 3916002

zbMATH Keywords

optimal solutioncutting stockcomplete-cut LP-modelreduction-rules

Mathematics Subject Classification ID

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

Cites Work

• A Linear Programming Approach to the Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II
• The trim-loss and assortment problems: A survey
• Near-optimal solutions to one-dimensional cutting stock problems
• A New Linear Programming Approach to the Cutting Stock Problem
• Title not available (Why is that?)
• The simplex SON algorithm for LP/embedded network problems
• Title not available (Why is that?)

Cited In (12)

• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
• Solution approaches for the cutting stock problem with setup cost
• LP models for bin packing and cutting stock problems
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• A note on handling residual lengths
• A typology of cutting and packing problems
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
• Knowledge based approach to the cutting stock problem
• 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

Uses Software

• LINDO

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

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