求解课程表问题的分支定界算法

A Branch and Bound Algorithm for Time Table Problem

本文通过对中学排课程表问题的特征分析 ,给出了基于分支定界法的优化算法 ,数值试验表明这是解决一般编排中学课程表问题的有效算法。

This paper studies the time table problem for middle schools.A branch and bound algorithm is proposed. Our experiment results show that the proposed algorithm is both efficient and effective for this problem.