The channel assignment problem belongs to the class of NP complete optimization problems, so we propose a new fixed channel assignment approach based on genetic algorithms.
信道分配问题属于组合优化中的NP完备问题,为此在遗传算法的基础上提出了一种新的固定信道分配方法。
In this paper, a class of board welding problems is posed. Some of the problems are proved to be NP-complete.
本文提出了一类拼板问题,并证明它们是NP—完全的。
应用推荐