𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A branch and bound algorithm for the strip packing problem

✍ Scribed by R. Alvarez-Valdes; F. Parreño; J. M. Tamarit

Publisher
Springer
Year
2008
Tongue
German
Weight
370 KB
Volume
31
Category
Article
ISSN
0171-6468

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

A branch and bound algorithm for the tra
A branch and bound algorithm for the traveling purchaser problem
✍ Kashi N. Singh; Dirk L. van Oudheusden 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 616 KB

An important generalization of the traveling salesman problem called the traveling purchaser problem is considered. A branch and bound algorithm which solves a related simple plant location problem for calculating the bounds is proposed for this problem. Computational experiments with this algorithm