A Linear Programming Approach to the Cutting-Stock Problem

@article{Gilmore1961ALP,
title={A Linear Programming Approach to the Cutting-Stock Problem},
author={P. Gilmore and R. Gomory},
journal={Operations Research},
year={1961},
volume={9},
pages={849-859}
}

The cutting-stock problem is the problem of filling an order at minimum cost for specified numbers of lengths of material to be cut from given stock lengths of given cost. When expressed as an integer programming problem the large number of variables involved generally makes computation infeasible. This same difficulty persists when only an approximate solution is being sought by linear programming. In this paper, a technique is described for overcoming the difficulty in the linear programming… Expand