.png){kind=icon}
Return
Approximation algorithms for the oriented two-dimensional bin packing problem
.png){kind=icon}
PRE
AI
DOI：10.1016/S0377-2217(97)00388-3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given a set of rectangular items which may not be rotated and an unlimited number of identical rectangular bins, we consider the problem of packing each item into a bin so that no two items overlap and the number of required bins is minimized. The problem is strongly NP-hard and finds practical applications in cutting and packing. We discuss a simple deterministic approximation algorithm which is used in the initialization of a tabu search approach. We then present a tabu search algorithm and analyze its average performance through extensive computational experiments. (C) 1999 Elsevier Science B.V. All rights reserved.
Keywords:
packing
cutting
heuristics
tabu search
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
6
Papers:
2.2W
Citations:
6.4W
Organization
No organization information available
Cited Papers
.png){kind=icon}
ShareSaveOn the Impact of Formative Assessment on Student Motivation, Achievement, and Conceptual Change
PREAI
ShareSave
ShareSaveShareSaveShareSave
View more