Formulate linear and integer programming problems for solving commonly encountered optimization problems. Understand how approximation algorithms compute solutions that are guaranteed to be within ...

In earlier papers [Opns. Res. 9, 849-859 (1961), and 11, 863-888 (1963)] the one-dimensional cutting stock problem was discussed as a linear programming problem. There it was shown how the difficulty ...

R. C. Daniel, Martyn Jeffreys, Unboundedness in Integer and Discrete Programming L.P. Relaxations, The Journal of the Operational Research Society, Vol. 30, No. 12 ...