A real-time one-dimensional cutting stock algorithm for balanced cutting patterns

DOI10.1016/0167-6377(93)90093-VzbMath0797.90117MaRDI QIDQ1318665

Francis J. Vasko, Micheal L. Cregger, Dennis D. Newhart, Kenneth L. jun. Stott

Publication date: 6 April 1994

Published in: Operations Research Letters (Search for Journal in Brave)

zbMATH Keywords

branch-and-boundcutting stock

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Integer programming (90C10) Production models (90B30) Combinatorial optimization (90C27)

Related Items (2)

A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^® ⋮ A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading

Cites Work

• The trim-loss and assortment problems: A survey
• Cutting stock problems and solution procedures
• The Trim Problem
• A Linear Programming Approach to the Cutting-Stock Problem
• A Linear Programming Approach to the Cutting Stock Problem—Part II

This page was built for publication: A real-time one-dimensional cutting stock algorithm for balanced cutting patterns