CC BY 4.0Daňková, MartinaŠustek, Jan2026-02-062026-02-062026DAŇKOVÁ, Martina and ŠUSTEK, Jan, 2026. A General Framework for Multiplets Selection: Algorithmization and Complexity Analysis. Online. In: STUPŇANOVÁ, Andrea; DYBA, Martin and PAVLISKA, Viktor (eds.). Proceedings of The Eighteenth International Conference on Fuzzy Set Theory and Applications. Ostrava: University of Ostrava, p. 46-49. ISBN 978-80-7599-515-5. Available at: https://doi.org/10.15452/978-80-7599-515-5.2026.07.10.15452/978-80-7599-515-5.2026.07https://eduo.osu.cz/handle/1/230In this contribution, we present the multiplets algorithm for constructing and selecting optimal sets of disjoint hyperedges across multiple groups in tabular data. We describe its main computational steps and provide a complexity analysis covering both the edge construction and optimization phases, based on the Linear Sum Assignment method and the Constraint Programming SAT-based solver.enfuzzy systemsmathematicsinformaticsinfo:eu-repo/semantics/conferencePaper519.1/.8 - Kombinatorika. Teorie grafů. Matematická statistika. Operační výzkum. Matematické modelovánífuzzy systémymatematikainformatika