Edge Minimizing the Student Conflict Graph

Author name not available (Why is that?)

Publication date: 12 February 2021

Abstract: 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.

Has companion code repository: https://github.com/mathprofessor/timetable

This page was built for publication: Edge Minimizing the Student Conflict Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6360489)