✦ LIBER ✦

A two-level search algorithm for 2D rectangular packing problem

✍ Scribed by Mao Chen; Wenqi Huang

Book ID: 108094663
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 728 KB
Volume: 53
Category: Article
ISSN: 0360-8352
DOI: 10.1016/j.cie.2007.04.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A genetic algorithm for a 2D industrial

A genetic algorithm for a 2D industrial packing problem

✍ E. Hopper; B. Turton 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 415 KB

A branch-and-price algorithm for the two

A branch-and-price algorithm for the two-dimensional level strip packing problem

✍ Andrea Bettinelli; Alberto Ceselli; Giovanni Righini 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 169 KB

A new heuristic recursive algorithm for

A new heuristic recursive algorithm for the strip rectangular packing problem

✍ Defu Zhang; Yan Kang; Ansheng Deng 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 460 KB

A quasi-human algorithm for solving the

A quasi-human algorithm for solving the three-dimensional rectangular packing problem

✍ Kun He; WenQi Huang 📂 Article 📅 2010 🏛 Science in China Press (SCP) 🌐 English ⚖ 474 KB

A Fast Algorithm for the Path 2-Packing

A Fast Algorithm for the Path 2-Packing Problem

✍ Maxim A. Babenko 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 668 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