With a growing interest in high-performing work teams and how to form them, a new computational challenge, denominated Team Formation Problem (TFP), has emerged. After almost two decades of research on this problem, many works continue to raise particular conceptions of what a TFP is. Any new practitioner, unfamiliar with the problem, may be hindered in discerning what is essential and what is particular in each proposal. Until now, there was a lack of a document serving as a guide, synthesizing and framing what has been done to date. In this review, we mainly introduce two things: (1) a taxonomy proposal for the TFPs and (2) the description of the main components of a TFP. Additionally, we present and discuss some applications, complexity, and resolution methods. Finally, we conclude by describing some perspectives on this topic for future studies, where we give some insight into open problems and research opportunities. The main goal of this review is to facilitate the generalization of research, identify knowledge gaps, and support the development of a theory for the TFP.

中文翻译：

---

团队组建问题的综合回顾与分类建议

随着人们对高绩效工作团队以及如何组建团队的兴趣日益浓厚，出现了一种新的计算挑战，称为团队组建问题 (TFP)。在对这个问题进行了近 20 年的研究之后，许多作品继续提出关于什么是 TFP 的特定概念。任何不熟悉该问题的新从业者都可能在辨别每个提案中什么是必要的和什么是特殊的方面受到阻碍。直到现在，还缺乏一份文件作为指南，综合和构建迄今为止所做的工作。在这篇评论中，我们主要介绍两件事：（1）TFP 的分类建议和（2）TFP 主要组成部分的描述。此外，我们还介绍并讨论了一些应用、复杂性和解决方法。最后，最后，我们描述了有关该主题的一些观点，以供未来研究，在其中我们对开放性问题和研究机会提供了一些见解。这篇综述的主要目的是促进研究的概括，识别知识差距，并支持 TFP 理论的发展。