An integer partition based algorithm for coalition structure generation

Simple item page
dc.contributor.authorBoonjing, Veera
dc.contributor.authorNarabin, Santit
dc.date.accessioned2026-08-06T09:56:12Z
dc.date.available2026-08-06T09:56:12Z
dc.date.issued2007-12-01
dc.description.abstractThis paper proposes a new algorithm to generate a minimal search space of the problem of coalition structure generation using a new optimal integer partition. The new partition includes only partitions giving optimal coalition structures. These partitions are those containing 1 at most one element. Our new algorithm generates optimal partition structures in two steps. The first step, we use a modified version of ZS1 algorithm to generate the optimal integer partition of input integer. We then use the partition to generate optimal coalition structures in the second step. © 2007 IEEE.
dc.identifier.citationCIT 2007 7th IEEE International Conference on Computer and Information Technology, 312-315, 2007
dc.identifier.doi10.1109/CIT.2007.4385100
dc.identifier.other2-s2.0-38049084734
dc.identifier.urihttps://dspace.kmitl.ac.th/handle/123456789/1890
dc.sourceCIT 2007 7th IEEE International Conference on Computer and Information Technology
dc.titleAn integer partition based algorithm for coalition structure generation
dc.typeConference Paper

Files

Collections

Research