作者: Gerhard W�scher , Thomas Gau
DOI: 10.1007/BF01539705
关键词:
摘要: In this paper the problem of generating integer solutions to standard one-dimensional cutting stock is treated. particular, we study a specific class heuristic approaches that have been proposed in literature, and some straightforward variants. These methods are compared with respect solution quality computing time. Our evaluation based on having solved 4,000 randomly generated test problems. Not only will it be shown two clearly superior others but also they solve almost any instance an optimum.