摘要
NP问题的解空间太大导致利用现有技术求解十分困难。针对这一问题 ,提出基于状态转移的组合优化方法。结合 0 / 1背包问题的求解 ,阐明这种方法求解问题的过程。实验结果表明这种方法是有效的。
It is very difficult to solute NP problem with current technology because the set of feasible solutions is very huge. State transition based combinatorial optimization is proposed to this problem. The solution process is described with the solution of 0/1 knapsack problem. The results show that state transition based combinatorial optimization is valid.
出处
《系统工程》
CSCD
北大核心
2003年第4期11-15,共5页
Systems Engineering
