A new approach to the one-dimensional cutting stock problem is described and compared to the classical model for which Gilmore and Gomory have developed a special column-generation technique. The new ...

We present a method for approximating the solution of mixed integer nonconcave programming problems in bounded variables. We present computational results for 39 test problems which suggest that the ...

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