Two- and three-dimensional parametric packing

Two- and three-dimensional parametric packing

0.00 Avg rating0 Votes
Article ID: iaor20083123
Country: United Kingdom
Volume: 34
Issue: 9
Start Page Number: 2589
End Page Number: 2603
Publication Date: Sep 2007
Journal: Computers and Operations Research
Authors: ,
Keywords: heuristics
Abstract:

We present approximation algorithms for the two- and three-dimensional bin packing problems and the three-dimensional strip packing problem. We consider the special case of these problems in which a parameter m (a positive integer) is given, indicating that each of the dimensions of the items to be packed is at most 1/m of the corresponding dimension of the recipient. We analyze the asymptotic performance of these algorithms and exhibit bounds that, to our knowledge, are the best known for this special case.

Reviews

Required fields are marked *. Your email address will not be published.