✦ LIBER ✦

A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems

✍ Scribed by Sándor P. Fekete; Jörg Schepers

Book ID: 105857993
Publisher: Springer
Year: 2004
Tongue: English
Weight: 374 KB
Volume: 60
Category: Article
ISSN: 0340-9422
DOI: 10.1007/s001860400376

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

One-dimensional relaxations and LP bound

One-dimensional relaxations and LP bounds for orthogonal packing

✍ G. Belov; V. Kartak; H. Rohling; G. Scheithauer 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 386 KB

Performance Bounds for Orthogonal Orient

Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms

✍ Golan, Igal 📂 Article 📅 1981 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 1000 KB

New lower bounds for the three-dimension

New lower bounds for the three-dimensional orthogonal bin packing problem

✍ Liao, Chung-Shou; Hsu, Chia-Hong 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Models and Bounds for Two-Dimensional Le

Models and Bounds for Two-Dimensional Level Packing Problems

✍ Andrea Lodi; Silvano Martello; Daniele Vigo 📂 Article 📅 2004 🏛 Springer US 🌐 English ⚖ 110 KB

A Best-first Branch-and-bound Algorithm

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

✍ M. Hifi; R. Ouafi 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 289 KB

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