.png){kind=icon}
返回
AN APPROXIMATION ALGORITHM FOR SOLVING UNCONSTRAINED 2-DIMENSIONAL KNAPSACK-PROBLEMS
.png){kind=icon}
PRE
AI
DOI：10.1016/0377-2217(93)E0221-I.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
An efficient heuristic for solving two-dimensional knapsack problems is proposed. The algorithm selects an optimal subset of optimal generated strips by solving a sequence of one-dimensional knapsack problems. We show that the number of these knapsacks can be reduced to only four knapsacks. The algorithm gives an excellent worst-case experimental approximation ratio (0.98), and a high percentage of optimal solutions (91%). From this heuristic, we derive an approximation algorithm for which we prove some refined bounds and we show that its approximation ratio is 4/9. Our numerical study on large size instances shows the efficiency of these algorithms for solving real-world problems which are hardly handled by other known methods, which are often limited by computer storage facilities.
Keyword:
2-DIMENSIONAL KNAPSACK
2-SPACE KNAPSACK
CUTTING STOCK PROBLEMS
KNAPSACK
APPROXIMATION ALGORITHMS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏
查看更多内容