Approaches to the Cutting Stock Problem

1 June 1976

journal article
research article
Published by Taylor & Francis in A I I E Transactions

Vol. 8 (2) , 265-274
https://doi.org/10.1080/05695557608975076

Abstract

In this paper, we survey various approaches to the cutting stock problem; available computational experience is discussed. The intention is to synthesize the considerable work that has been done on this problem. The different approaches studied will include column generation, zero-one programming, combinatorial heuristics, and subgradient optimization. Applications to related combinatorial optimization problems are mentioned.

Keywords

This publication has 18 references indexed in Scilit:

Fast algorithms for bin packing
Published by Elsevier ,2007
Validation of subgradient optimization
Mathematical Programming, 1974
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
SIAM Journal on Computing, 1974
Lagrangean relaxation for integer programming
Published by Springer Nature ,1974
Reducibility among Combinatorial Problems
Published by Springer Nature ,1972
The traveling-salesman problem and minimum spanning trees: Part II
Mathematical Programming, 1971
The Loading Problem
Management Science, 1971
Duality in Nonlinear Programming: A Simplified Applications-Oriented Development
SIAM Review, 1971
Multistage Cutting Stock Problems of Two and More Dimensions
Operations Research, 1965
Mathematical Methods of Organizing and Planning Production
Management Science, 1960