.png){kind=icon}
返回
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}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
packing
cutting
heuristics
tabu search
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
On the Impact of Formative Assessment on Student Motivation, Achievement, and Conceptual Change
PREAI
分享收藏
查看更多内容