A Note on Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problems
暂无分享,去创建一个
One algorithm proposed in “Branch-and-price algorithms for the one-dimensional cutting stock problems” (COAP, vol. 9, pp. 211–228, 1998) may not find an optimal solution to the cutting stock problem, as it is stated.
[1] Pamela H. Vance,et al. Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem , 1998, Comput. Optim. Appl..