返回
A recursive computational procedure for container loading
DOI:10.1016/S0360-8352(98)00084-9.png)
摘要
En 中文
This paper presents a new procedure for loading different sized boxes in a freight container of known dimensions so as to minimize the waste of container space. We incorporate the mechanisms of comparing the solution values with upper bonds to reduce unnecessary calculations. (C) 1998 Elsevier Science Ltd. All rights reserved.
Keyword:
container loading
cutting problems
three-dimensional knapsack
optimization
transportation
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
暂无机构信息
引用论文
AN APPROXIMATION ALGORITHM FOR SOLVING UNCONSTRAINED 2-DIMENSIONAL KNAPSACK-PROBLEMS求解无约束二维背包问题的一种近似算法
没有更多内容

