The computational results on problems with up to 2750 variables strongly confirm our hypothesis that a combination of problem preprocessing, cutting planes, and clever branch-and-bound techniques ...

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 ...

Marshall, Paul W. "Linear Programming: A Technique for Analyzing Resource Allocation Problems." Harvard Business School Background Note 171-322, January 1971. (Revised November 1975 ...