An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
Publisher： Taylor & Francis Ltd
ISSN： 0020-7543
Source： International Journal of Production Research, Vol.49, Iss.15, 2011-08, pp. : 4437-4455
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Access to resources
Recommend
