Cutting Plane Methods: Iterative procedures that add valid inequalities (cuts) to eliminate non-integral solutions in a relaxed problem without removing any feasible integer solutions.

Linear Programming: Basics, Simplex Algorithm, and Duality. Applications of Linear Programming: regression, classification and other engineering applications. Integer Linear Programming: Basics, ...

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

This is a preview. Log in through your library . Abstract This paper elaborates a method of attack on traveling-salesman problems, proposed by the authors in an earlier paper, in which linear ...