TítuloA MaxSAT-Based Approach to the Team Composition Problem in a Classroom
Publication TypeConference Proceedings
Year of Conference2017
AuthorsManyà F, Negrete S, Roig C, Soler JRamon
Conference NameFIRST INTERNATIONAL WORKSHOP ON TEAMS IN MULTIAGENT SYSTEMS
EditorialAAMAS 2017
Paginación82-89
Conference LocationSão Paulo, Brazil
Date PublishedMay, 9 2017
Resumen

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.