✦ LIBER ✦

Heuristic algorithms for on-line packing in three dimensions

✍ Scribed by Keoin Li; Kam Hoi Cheng

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 887 KB
Volume: 13
Category: Article
ISSN: 0196-6774
DOI: 10.1016/0196-6774(92)90058-k

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Shelf algorithms for on-line strip packi

Shelf algorithms for on-line strip packing

✍ János Csirik; Gerhard J. Woeginger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 461 KB

In the strip packing problem, the goal is to pack a set of rectangles into a vertical strip of unit width so as to minimize the total height of the strip needed. For the on-line version of this problem, Baker and Schwarz introduced the class of so-called shelf algorithms. One of these shelf algorith

Bin packing problems in one dimension: H

Bin packing problems in one dimension: Heuristic solutions and confidence intervals

✍ Nicholas G. Hall; Soumen Ghosh; Roland D. Kankey; Sridhar Narasimhan; WanSoo T. 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 612 KB

Estimation of length for digitized strai

Estimation of length for digitized straight lines in three dimensions

✍ T.M. Amarunnishad; P.P. Das 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 460 KB

Simple methods for computing the least s

Simple methods for computing the least squares line in three dimensions

✍ Peter C. Kahn 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 412 KB

Implementation of a randomized algorithm

Implementation of a randomized algorithm for Delaunay and regular triangulations in three dimensions

✍ Michael A. Facello 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1020 KB

Variational methods for generating meshe

Variational methods for generating meshes on surfaces in three dimensions

✍ Jeffrey Saltzman 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 841 KB