logo
CanyamAI summaries for academic research
language
MobileMobile
  • Phone FeatureWeChat Mini Program
EnglishEnglish
noticeNotice
BlogBlog
delete
arrow
Return

Two- and three-dimensional parametric packing

delete2007-09-01
delete20
PRE
AI
F
Flávio K. Miyazawa *
Y
Yoshiko Wakabayashi
DOI：10.1016/j.cor.2005.10.001delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
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 in (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. (c) 2005 Elsevier Ltd. All rights reserved.
Keywords:
approximation algorithms
asymptotic performance
packing
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

C
Computers and Operations Research
IF:
4.3
Papers:
6.5K
Citations:
1.8W

Organization

No organization information available