A hybrid exact algorithm for complete set partitioning
type: Item
instance of: scholarly article
title: A hybrid exact algorithm for complete set partitioning
zbMATH Open document ID: 1344.68271
author: Talal Rahwan
author: Edith Elkind
author: M. J. Wooldridge
author: Nicholas R. Jennings
author: Tomasz P. Michalak
published in: Artificial Intelligence
publication date: 2015-12-23T00:00:00Z
full work available at URL: 1-s2.0-S0004370215001423-main.pdf
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 91A10
Mathematics Subject Classification ID: 91B26
zbMATH DE Number: 6523951
zbMATH Keywords: complete set partitioning
zbMATH Keywords: coalition structure generation
zbMATH Keywords: dynamic programming
zbMATH Keywords: coalition formation
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W2128510237
cites work: Q3156941
cites work: Computing cooperative solution concepts in coalitional skill games
cites work: Exponential Numbers
cites work: Set Partitioning via Inclusion-Exclusion
cites work: Q3219268
cites work: The Set-Partitioning Problem: Set Covering with Equality Constraints
cites work: Anytime coalition structure generation: an average case study
cites work: An efficient algorithm for the complete set partitioning problem
cites work: Graphs and Cooperation in Games
cites work: An algorithm for distributing coalitional value calculations among cooperating agents
cites work: Q3624192
cites work: Anytime coalition structure generation in multi-agent systems with positive or negative externalities
cites work: Computationally manageable combinational auctions
cites work: Algorithm for optimal winner determination in combinatorial auctions
cites work: Coalition structure generation with worst case guarantees
cites work: Methods for task allocation via agent coalition formation
cites work: Q4344108
cites work: Q4414647
cites work: A dynamic programming approach to the complete set partitioning problem
DOI: 10.1016/J.ARTINT.2015.09.006
Recommended article: Q3741427
Recommended article: Metodos Duales y algoritmos hibridos para problemas de «Set Partitioning»
Recommended article: A dynamic programming approach to the complete set partitioning problem
Recommended article: An efficient algorithm for a special case of the set partition problem
Recommended article: Q3735467
Recommended article: A relax-and-cut algorithm for the set partitioning problem
Recommended article: An efficient algorithm for judicious partition of hypergraphs
Recommended article: An exact algorithm for graph partitioning
Recommended article: On probabilistic algorithm for solving almost all instances of the set partition problem
description: scientific article; zbMATH DE number 6523951