.png){kind=icon}
.png){kind=icon}
Return
Integer programming approaches to the multiple team formation problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2021.105354.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Given a group of individuals, each one with a single skill, and a social network capturing the mutual affinity among them, the Multiple Team Formation Problem (MTFP) consists in finding a set of teams, as harmonious as possible, each one comprising a given number of required skills. Dedication time of individuals can be partitioned into time fractions, thus allowing an individual to work in more than one team. In this work, we propose an Integer Linear Programming (ILP) formulation and sets of valid inequalities for the problem. Computational experiments carried out on test instances, generated according to the literature or based on real -world social networks, attest that the ILP model strengthened by valid inequalities consistently outperforms the existing quadratic formulation for MTFP.
Keywords:
Multiple team formation problem
Sociotechnical requirement
Integer Linear Programming
Valid inequality
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W