In this paper we consider the problem of forming student teams adequate for company internship tasks. First, we provide a formalisation of the Feasible Team-For-Task Allocation Problem, and show the computational hardness of solving it optimally. Thereafter, we propose Edu2Com, an any- time heuristic algorithm that generates an initial team allocation that is then improved in an iterative process. Finally, we conduct a systematic evaluation and show that Edu2Com manages to (a) out- perform CPLEX in computation time, and (b) reach optimality, in the experiments considered.
Back to AI for Social Good event