constrained two - dimensional cutting stock problems a best - first branch - and - bound algorithm constrained two - dimensional cutting stock problems a best - first branch - and - bound algorithm .
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems