A new algorithm of curriculum schedule based on bipartite-graph matching and Tabu search is proposed to meet the new requirements of the universities.
针对目前高校的特点，提出一种偶图匹配和禁忌搜索相结合的排课新算法。
An improved Boolean matching algorithm based on transforming the mapping between Boolean variables into the problem of perfect matching of bipartite graph is presented.
提出了一种改进的基于二分图完美匹配的布尔匹配算法。
应用推荐