边最小化学生冲突图
Edge Minimizing the Student Conflict Graph
摘要：
在许多学校里，课程是分班讲授的。在开始之前，学生需要被分配到各个部分。我们给出了一个混合近似剖分算法，最大限度地减少学生冲突图（SCG）中的边缘（潜在冲突）的数量。我们从一个贪心算法开始，以获得一个起始的解决方案，然后继续与约束规划为基础的算法（CP-SAT），减少边缘的数量。我们应用的切片算法，我们指定的高度约束的callabling模型。
英文摘要：
In many schools, courses are given in sections. Prior to timetabling students need to be assigned to individual sections. We give a hybrid approximation sectioning algorithm that minimizes the number of edges (potential conflicts) in the student conflict graph (SCG). We start with a greedy algorithm to obtain a starting solution and then continue with a constraint programming based algorithm (CP-SAT) that reduces the number of edges. We apply the sectioning algorithm to a highly constrained timetabling model which we specify.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
