.png){kind=icon}
返回
Corner occupying theorem for the two-dimensional integral rectangle packing problem
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-012-4702-8.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. Based on this theorem, we might develop efficient heuristic algorithms for solving the integral rectangle packing problem. In fact, as a vague conjecture, this theorem has been implicitly mentioned with different appearances by many people for a long time.
Keyword:
rectangle packing
bottom-left
corner occupying theorem
NP hard
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
暂无机构信息
引用论文
The effect of 3-nitropropionic acid on behavioral dysfunction, neuron loss and gliosis in the brain of adult male rats: The case of prefrontal cortex, hippocampus and the cerebellum.png)
Toxicon
ToxiconIF0
PREAI
分享收藏
查看更多内容