This is the twenty third part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Hi all! Last time we saw how to handle continuous classes for students. Today we are going to consider students who prefer to have as many … Continue reading ILP Part 23 — Students Placement Problem Part 6 — Days off

This is the twenty second part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Last time we saw how to include preferences points in the cost function. Today we are going to implement yet another nice feature of our scheduling … Continue reading ILP Part 22 — Students Placement Problem Part 5 — Continuous Classes

This is the twenty first part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra So far, we have defined constraints which make our final solution “feasible”. The students will likely not be very happy with their schedules, but they will … Continue reading ILP Part 21 — Students Placement Problem Part 4 — Basic cost function

This is the twentieth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra Last time we defined necessary constraints for students placement problem. Today we are going to implement something similar. We will still focus on defining requirements for schedule … Continue reading ILP Part 20 — Students Placement Problem Part 3 — Useful constraints

This is the nineteenth part of the ILP series. For your convenience you can find other parts in the table of contents in Part 1 – Boolean algebra In previous part we introduced Students Placement Problem. Today we start implementing it using ILP. We will define the variables and consider constraints which are required. We … Continue reading ILP Part 19 — Students Placement Problem Part 2 — Necessary constraints