✦ LIBER ✦

A Best-first Branch-and-bound Algorithm for Orthogonal Rectangular Packing Problems

✍ Scribed by M. Hifi; R. Ouafi

Book ID: 111205634
Publisher: John Wiley and Sons
Year: 1998
Tongue: English
Weight: 289 KB
Volume: 5
Category: Article
ISSN: 0969-6016
DOI: 10.1111/j.1475-3995.1998.tb00119.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A best-first branch-and-bound algorithm

A best-first branch-and-bound algorithm for orthogonal rectangular packing problems

✍ 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

Constrained two-dimensional cutting stoc

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

✍ V-D. Cung; M. Hifi; B. Le Cun 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 442 KB

Constrained two-dimensional cutting stoc

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

✍ Van-Dat Cung; Mhand Hifi; Bertrand Le Cun 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 448 KB

A branch and bound algorithm for the str

A branch and bound algorithm for the strip packing problem

✍ R. Alvarez-Valdes; F. Parreño; J. M. Tamarit 📂 Article 📅 2008 🏛 Springer 🌐 German ⚖ 370 KB

A branch-and-bound algorithm for the two

A branch-and-bound algorithm for the two-dimensional vector packing problem

✍ Frits C.R. Spieksma 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A study of parallel branch-and-bound alg

A study of parallel branch-and-bound algorithms with best-bound-first search

✍ J.M Troya; M Ortega 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 363 KB