Exact solution of cutting stock problems
β
J.M.ValΓ©rio de Carvalho
π
Article
π
1998
π
John Wiley and Sons
π
English
β 247 KB
This paper describes an attempt to solve the one-dimensional cutting stock problem exactly, using column generation and branch-and-bound. A new formulation is introduced for the one-dimensional cutting stock problem that uses general integer variables, not restricted to be binary. It is an arc Β―ow f