๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Constrained two-dimensional cutting stock problems a best-first branch-and-bound algorithm

โœ Scribed by Van-Dat Cung; Mhand Hifi; Bertrand Le Cun


Book ID
108481145
Publisher
John Wiley and Sons
Year
2000
Tongue
English
Weight
448 KB
Volume
7
Category
Article
ISSN
0969-6016

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


A best-first branch-and-bound algorithm
โœ Mhand Hifi; Rachid Ouafi ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 294 KB

In this paper we discuss the problem of packing a set of small rectangles (pieces) in an enclosing ยฎnal rectangle. We present ยฎrst a best-ยฎrst branch-and-bound exact algorithm and second a heuristic approach in order to solve exactly and approximately this problem. The performances of the proposed a