论文标题
1D切割库存问题的最佳算法
An Optimal Algorithm for 1-D Cutting Stock Problem
论文作者
论文摘要
我们提出了$nδ^{o（k^2）} $ time算法，以获取$ 1 $二维切割库存问题的最佳解决方案：将$ n $ n $项目包装到单位容量垃圾箱的bin包装问题限制$ k $ $ k $是固定的，其中$δ$是$δ$的尺寸。我们在设计和分析我们的算法中采用基本思想。
We present an $nΔ^{O(k^2)}$ time algorithm to obtain an optimal solution for $1$-dimensional cutting stock problem: the bin packing problem of packing $n$ items onto unit capacity bins under the restriction that the number of item sizes $k$ is fixed, where $Δ$ is the reciprocal of the size of the smallest item. We employ elementary ideas in both the design and analysis our algorithm.
