Abstract
We consider the one-dimensional skiving stock problem, also known as the dual bin packing problem, with the aim of maximizing the best known dual and ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
