This program can be used to compute optimal assignments between persons and tasks. The problem is modeled as a maximum weighted bipartite b-matching problem. That is, persons can express preferences for tasks and there are lower and upper bounds on the number of tasks assigned to a person and vice versa. The problem is translated into an integer linear program (ILP). The program uses COIN-OR or CPLEX to solve the ILP.

Use Cases

  • assign students to tutorial groups
  • assign students to seminar topics
  • assign tutors to seminar topics