摘要
2004年孙春玲等研究了一维装箱问题,给出了一个近似程度最好的近似值为3/2的近似算法-交叉算法.遗憾的是他们的交叉算法的近似值分析是错误的,本文通过两个反例说明了他们的错误所在,并给出一个正确的近似值分析.
In 2004, Sun Chun-ling, et al. studied the Bin-Packing problem and proposed an approximation algorithm called Cross Fit algorithm. Its worst-case performance ratio bound is 3/2 which is the best bound of heuristics for the Bin-Packing problem. The purpose of this paper is to point out that their analysis of the bound for Cross Fit algorithm is incorrect by two counterexamples and then provide a correct analysis.
出处
《台州学院学报》
2009年第3期1-5,共5页
Journal of Taizhou University
关键词
装箱问题
强NP-难
近似算法
反例
Bin-Packing problem
strongly NP＇hard
approximation algorithm
counterexample.
作者简介
李杉林（1956-），山西太原人，硕士，副教授，丰要最优化理论及应用研究。
