Class Scheduling to Boolean satisfiability [Polynomial-time reduction] part 2
问题 I asked few days ago, a question about how to transform a University Class Scheduling Problem into a Boolean Satisfiability Problem. (Class Scheduling to Boolean satisfiability [Polynomial-time reduction]) I got an answer by @Amit who was very elegant and easy to code. Basically, his answer was like this : instead of considering courses, he considered time-intervals. So for the i-th course, he just indicted all the possible intervals for this course. And we obtain a solution when there is at