@proceedings {56013, title = {A MaxSAT-Based Approach to the Team Composition Problem in a Classroom}, journal = {FIRST INTERNATIONAL WORKSHOP ON TEAMS IN MULTIAGENT SYSTEMS}, year = {2017}, month = {May, 9 2017}, pages = {82-89}, publisher = {AAMAS 2017}, address = {S{\~a}o Paulo, Brazil}, abstract = {Abstract. Given a classroom containing a fixed number of students and a fixed number of tables that can be of different sizes, as well as a list of preferred classmates to sit with for each student, the team composition problem in a classroom (TCPC) is the problem of finding an assignment of students to tables in such a way that preferences are maximally-satisfied. In this paper, we formally define the TCPC, prove that it is NP-hard and define a MaxSAT model of the problem. Moreover, we report on the results of an empirical investigation that show that solving the TCPC with MaxSAT solvers is a promising approach. }, author = {Felip Many{\`a} and Santiago Negrete and Carme Roig and Joan Ramon Soler} }