This is a combinatorial problem in canonical form.
这是组合论中的典型问题。
It can easily be modified for any combinatorial problem for which we have no good specialized algorithm.
对于目前还没有好的解法的组合优化问题，很容易地修改此算法就可解决。
This paper presents the mathematical model and the general algorithms of transforming combinatorial problem into state space search.
本文提出了将组合问题归结为状态空间搜索问题的数学模型和通用算法。
应用推荐