OU Portal
Log In
Welcome
Applicants
Z6_60GI02O0O8IDC0QEJUJ26TJDI4
Error:
Javascript is disabled in this browser. This page requires Javascript. Modify your browser's settings to allow Javascript to execute. See your browser's documentation for specific instructions.
{}
Close
Publikační činnost
Probíhá načítání, čekejte prosím...
publicationId :
tempRecordId :
actionDispatchIndex :
navigationBranch :
pageMode :
tabSelected :
isRivValid :
Record type:
stať ve sborníku (D)
Home Department:
Ústav pro výzkum a aplikace fuzzy modelování (94410)
Title:
A General Framework for Multiplets Selection: Algorithmization and Complexity Analysis
Citace
Daňková, M. a Šustek, J. A General Framework for Multiplets Selection: Algorithmization and Complexity Analysis.
In:
The Eighteenth International Conference on Fuzzy Set Theory and Applications 2026: Proceedings of The Eighteenth International Conference on Fuzzy Set Theory and Applications 2026-01-25 Liptovský Ján.
Ostrava: University of Ostrava, 2026. s. 46-49. ISBN 978-80-7599-514-8.
Subtitle
Publication year:
2026
Obor:
Number of pages:
4
Page from:
46
Page to:
49
Form of publication:
Tištená verze
ISBN code:
978-80-7599-514-8
ISSN code:
Proceedings title:
Proceedings of The Eighteenth International Conference on Fuzzy Set Theory and Applications
Proceedings:
Mezinárodní
Publisher name:
University of Ostrava
Place of publishing:
Ostrava
Country of Publication:
Sborník vydaný v ČR
Název konference:
The Eighteenth International Conference on Fuzzy Set Theory and Applications 2026
Conference venue:
Liptovský Ján
Datum zahájení konference:
Typ akce podle státní
příslušnosti účastníků:
Celosvětová akce
WoS code:
EID:
Key words in English:
Exact optimization; Linear Sum Assignment method; Constraint Programming SAT-based solver; OR-Tools
Annotation in original language:
In this contribution, we present the multiplets algorithm for constructing and selectingoptimal sets of disjoint hyperedges across multiple groups in tabular data. We describeits main computational steps and provide a complexity analysis covering both the edgeconstruction and optimization phases, based on the Linear Sum Assignment method andthe Constraint Programming SAT-based solver.
Annotation in english language:
In this contribution, we present the multiplets algorithm for constructing and selectingoptimal sets of disjoint hyperedges across multiple groups in tabular data. We describeits main computational steps and provide a complexity analysis covering both the edgeconstruction and optimization phases, based on the Linear Sum Assignment method andthe Constraint Programming SAT-based solver.
References
Reference
R01:
Complementary Content
Deferred Modules
${title}
${badge}
${loading}
Deferred Modules
Probíhá načítání, čekejte prosím...