摘要
针对一类组合优化问题-多维0-1背包问题(MKP),属于NP-难问题,提出一种能 减少求解难度的方法——可行域替代解法。给出了MKP的替代约束的概念,提出了一种具体替代 多约束组的计算方法。最后,通过具体的实例,阐述了算法的使用方法。
In this paper, we raise a method of reducing＂ the solving difficulty-the creative method of non--equivalence single restrict, aiming at a kind of combination and optimized problem-multi--dimension 0-1 knapsack problem （also called the NP-hard problem）. We define the replacement restrictive conception of this problem, and lodged a calculation method of a replacing restrict group with a single restrict condition. Finaly, We explained the usage for this algorithm with practical example.
出处
《渤海大学学报（自然科学版）》
CAS
2005年第4期327-330,共4页
Journal of Bohai University:Natural Science Edition
基金
辽宁省教育厅科研项目资助(2004C59).
