We present an efficient method for solving approximately both constrained and unconstrained two-dimensional cutting stock problems. The algorithm guarantees a constant approximation ratio for some ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback