摘要
针对一类组合优化问题—多维 0 - 1背包问题 ( MKP) ,这是一个 NP-难问题 ,提出一种能减少求解难度的方法—约束化简方法。定义了 MKP的紧约束的概念。提出了一种代替多约束组的计算方法。对于经过替换后所得到的新问题 ,证明了与其原问题解精度上的等价性。
The authors we lodged a method of reducing the solving difficulty the creative method of nonequivalence single restrict, aim at a kind of combination and optimize problem multi dimension 0 1 knapsack problem(also called the NP hard problem). We defined the tightness restrictive conception of this problem, and lodged a calculation method of replacing a restrict group with a single restrict condition. We proved the equivalence property of solution precision between original problem and new problem that be replaced.
出处
《锦州师范学院学报（自然科学版）》
2001年第2期11-13,共3页
Journal of Jinzhou Normal College (Natural Science Edition)
基金
辽宁省教育厅科学基金资助 ( 980 81110 79)
