Solving the Team Composition Problem in a Classroom

DOI10.3233/FI-2020-1933MaRDI QIDQ5134294zbMATH OpenOpenAlexFDO

Authors Felip Manya, Santiago Negrete, Carme Roig, Joan Ramon Soler

Publication date 16 November 2020

Published in Fundamenta Informaticae (Search for Journal in Brave)

Full work available at URL https://doi.org/10.3233/fi-2020-1933

zbMATH Keywords

encodingMaxSATNP-hardnessoptimization solverteam creation

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Agent technology and artificial intelligence (68T42)

Recommendations

• The multiple team formation problem using sociometry
• On the complexity of efficient multi-skilled team composition

Cited in

(4)

• When Is the Classroom Assignment Problem Hard?
• Proofs and Certificates for Max-SAT
• MaxSAT resolution for regular propositional logic
• Solving weighted maximum satisfiability with branch and bound and clause learning

This page was built for publication: Solving the Team Composition Problem in a Classroom

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5134294)