A hybrid exact algorithm for complete set partitioning
- Submitting institution
-
University of Oxford
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 1970
- Type
- D - Journal article
- DOI
-
10.1016/j.artint.2015.09.006
- Title of journal
- ARTIFICIAL INTELLIGENCE
- Article number
- -
- First page
- 14
- Volume
- 230
- Issue
- -
- ISSN
- 0004-3702
- Open access status
- Out of scope for open access requirements
- Month of publication
- September
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
4
- Research group(s)
-
-
- Citation count
- 21
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Set partitioning is a fundamental NP-hard computational problem, which arises in many settings. In multi-agent systems it corresponds to the problem of finding the most effective way to divide agents into teams. This paper presents a new algorithm for this problem that innovatively synthesises the two best-known previous approaches, and shows that the new algorithm significantly outperforms the state of the art. The substantial performance advances on a fundamental algorithmic problem afforded by our novel solution have impacted upon subsequent work: e.g. Tokimoto et al. base their AmorCSG algorithm on our approach (https://doi.org/10.1007/978-3-030-03098-8_9); see also e.g. https://dl.acm.org/citation.cfm?id=2937012, AAMAS�16; https://doi.org/10.1007/978-3-319-59294-7_11, EUMAS�16.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -