✦ LIBER ✦

Two-dimensional packing: expected performance of simple level algorithms

✍ Scribed by Micha Hofri

Book ID: 114037526
Publisher: Elsevier Science
Year: 1980
Weight: 729 KB
Volume: 45
Category: Article
ISSN: 0019-9958
DOI: 10.1016/s0019-9958(80)90817-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

A simple randomized algorithm for two-di

A simple randomized algorithm for two-dimensional strip packing

✍ Yang, Shuangyuan; Han, Shuihua; Ye, Weiguo 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Probabilistic analysis for simple one-an

Probabilistic analysis for simple one-and two-dimensional bin packing algorithms

✍ Greg N. Frederickson 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 805 KB

Expected performance of the shelf heuris

Expected performance of the shelf heuristic for 2-dimensional packing

✍ John J. Bartholdi III; John H. Vande Vate; Jixian Zhang 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 436 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

Performance evaluation of Two-level Sche

Performance evaluation of Two-level Scheduling algorithms for NUMA multiprocessors

✍ Yukio Ohishi; Keizo Saisho; Akira Fukuda 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 210 KB

In this article, we simulate and evaluate various Twolevel Scheduling algorithms for cluster-based NUMA (Non-Uniform Memory Access) multiprocessors. Twolevel Scheduling is a kind of space partitioning scheduling. We evaluate the following variations: (1) Cluster-free Algorithm and (2) Cluster-limite