# TAIP: an anytime algorithm for allocating student teams to internship programs

arXiv: https://arxiv.org/abs/2005.09331 · HTML: https://mlsanity.com/paper/2005.09331/

## Key facts

- Cited by 1 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 May 2020.

## Built on by (most cited first, 1 of 1)

- [Leveraging Diversity in Online Interactions](https://mlsanity.com/paper/2309.11224/) (2023)

## Abstract (arXiv)

In scenarios that require teamwork, we usually have at hand a variety of specific tasks, for which we need to form a team in order to carry out each one. Here we target the problem of matching teams with tasks within the context of education, and specifically in the context of forming teams of students and allocating them to internship programs. First we provide a formalization of the Team Allocation for Internship Programs Problem, and show the computational hardness of solving it optimally. Thereafter, we propose TAIP, a heuristic algorithm that generates an initial team allocation which later on attempts to improve in an iterative process. Moreover, we conduct a systematic evaluation to show that TAIP reaches optimality, and outperforms CPLEX in terms of time.