{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,20]],"date-time":"2025-06-20T04:10:21Z","timestamp":1750392621296,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319592930"},{"type":"electronic","value":"9783319592947"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-59294-7_11","type":"book-chapter","created":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T10:19:10Z","timestamp":1498126750000},"page":"124-139","source":"Crossref","is-referenced-by-count":4,"title":["Heuristic Methods for Optimal Coalition Structure Generation"],"prefix":"10.1007","author":[{"given":"Amir","family":"Hussin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shaheen","family":"Fatima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,6,23]]},"reference":[{"key":"11_CR1","unstructured":"Banerjee, B., Kraemer, L.: Coalition structure generation in multi-agent systems with mixed externalities. In: Proceedings of AAMAS, pp. 175\u2013182 (2010)"},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1016\/S0305-0548(98)00047-1","volume":"26","author":"G Barbarosoglu","year":"1999","unstructured":"Barbarosoglu, G., Ozgur, D.: A tabu search algorithm for the vehicle routing problem. Comput. Oper. Res. 26, 255\u2013270 (1999)","journal-title":"Comput. Oper. Res."},{"key":"11_CR3","volume-title":"Computational Aspects of Cooperative Game Theory","author":"G Chalkiadakis","year":"2011","unstructured":"Chalkiadakis, G., Elkind, E., Wooldrdidge, M.: Computational Aspects of Cooperative Game Theory. Morgan and Claypool Publishers, San Rafael (2011)"},{"issue":"1","key":"11_CR4","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/S0378-7796(98)00119-9","volume":"49","author":"C Chang","year":"1999","unstructured":"Chang, C., Lu, L., Wen, F.: Power system network partitioning using tabu search. Electr. Power Syst. Res. 49(1), 55\u201361 (1999)","journal-title":"Electr. Power Syst. Res."},{"issue":"6","key":"11_CR5","doi-asserted-by":"crossref","first-page":"1413","DOI":"10.3982\/ECTA7224","volume":"76","author":"GD Clippel","year":"2008","unstructured":"Clippel, G.D., Serrano, R.: Margainal contributions and externalities in the value. Econometrica 76(6), 1413\u20131436 (2008)","journal-title":"Econometrica"},{"issue":"1","key":"11_CR6","doi-asserted-by":"crossref","first-page":"43","DOI":"10.5711\/morj.9.1.43","volume":"9","author":"T Combs","year":"2004","unstructured":"Combs, T., Moore, J.: A hybrid tabu search set partitioning approach to tanker crew scheduling. Mil. Oper. Res. 9(1), 43\u201356 (2004)","journal-title":"Mil. Oper. Res."},{"key":"11_CR7","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1016\/j.ejor.2007.06.063","volume":"195","author":"G Crainic","year":"2004","unstructured":"Crainic, G., Perboli, G., Tadei, R.: Ts2pack: a two-level tabu search for the three-dimensional bin packing problem. Eur. J. Oper. Res. 195, 744\u2013760 (2004)","journal-title":"Eur. J. Oper. Res."},{"key":"11_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/978-3-642-15431-7_12","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications","author":"N Mauro Di","year":"2010","unstructured":"Di Mauro, N., Basile, T.M.A., Ferilli, S., Esposito, F.: Coalition structure generation with GRASP. In: Dicheva, D., Dochev, D. (eds.) AIMSA 2010. LNCS, vol. 6304, pp. 111\u2013120. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15431-7_12"},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-642-40669-0_35","volume-title":"Portuguese Conference on Artificial Intelligence","author":"D Epstein","year":"2013","unstructured":"Epstein, D., Bazzan, A.L.C.: Distributed coalition structure generation with positive and negative externalities. In: Correia, L., Reis, L.P., Cascalho, J. (eds.) EPIA 2013. LNCS, vol. 8154, pp. 408\u2013419. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-40669-0_35"},{"key":"11_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F Glover","year":"1997","unstructured":"Glover, F., Laguna, M.: Tabu Search. Kluwer Academic Publishers, Dordrecht (1997)"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Guo, B., Wang, D.: Optimal coalition structure based on particle swarm optimization algorithm in multi-agent system. In: Proceedings of the Sixth World Congress on Intelligent Control and Automation, pp. 2494\u20132497 (2006)","DOI":"10.1109\/WCICA.2006.1712810"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1007\/978-3-642-01665-3_4","volume-title":"Agent and Multi-Agent Systems: Technologies and Applications","author":"H Kein\u00e4nen","year":"2009","unstructured":"Kein\u00e4nen, H.: Simulated annealing for multi-agent coalition formation. In: H\u00e5kansson, A., Nguyen, N.T., Hartung, R.L., Howlett, R.J., Jain, L.C. (eds.) KES-AMSTA 2009. LNCS, vol. 5559, pp. 30\u201339. Springer, Heidelberg (2009). doi: 10.1007\/978-3-642-01665-3_4"},{"key":"11_CR13","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 3\u201330 (1998)","journal-title":"ACM Trans. Model. Comput. Simul."},{"key":"11_CR14","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","volume":"21","author":"N Metropolis","year":"1953","unstructured":"Metropolis, N., Rosenbluth, A., Rosenbluth, M., Teller, A., Teller, E.: Equation of state calculations by fast computing machines. J. Chem. Phys. 21, 1087\u20131092 (1953)","journal-title":"J. Chem. Phys."},{"key":"11_CR15","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/j.artint.2015.09.006","volume":"230","author":"T Michalak","year":"2016","unstructured":"Michalak, T., Rahwan, T., Elkind, E., Wooldridge, M., Jennings, N.R.: A hybrid exact algorithm for complete set partitioning. Artif. Intell. 230, 14\u201350 (2016)","journal-title":"Artif. Intell."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"665","DOI":"10.1007\/s00291-011-0274-z","volume":"34","author":"A Misevicius","year":"2012","unstructured":"Misevicius, A.: An implementation of the iterated tabu search algorithm for the quadratic assignment problem. OR Spectr. 34, 665\u2013690 (2012)","journal-title":"OR Spectr."},{"key":"11_CR17","unstructured":"Murillo, A., Piza, E., Trejos, J.: A tabu search algorithm for partitioning. Technical report (1999)"},{"key":"11_CR18","volume-title":"An Introduction to Multiagent Systems","author":"M Wooldridge","year":"2009","unstructured":"Wooldridge, M.: An Introduction to Multiagent Systems. Wiley, Hoboken (2009)"},{"key":"11_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4471-0721-7","volume-title":"Intelligent optimisation techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks","author":"D Pham","year":"2000","unstructured":"Pham, D., Karaboga, D.: Intelligent optimisation techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks. Springer, Heidelberg (2000)"},{"key":"11_CR20","unstructured":"Rahwan, T., Michalak, T., Jennings, N.R., Wooldridge, M., McBurney, P.: Coalition structure generation in multi-agent systems with positive and negative externalities. In: Proceedings of IJCAI, pp. 257\u2013263 (2009)"},{"key":"11_CR21","first-page":"139","volume":"229","author":"T Rahwan","year":"2015","unstructured":"Rahwan, T., Michalak, T.P., Wooldridge, M., Jennings, N.R.: Coalition structure generation: a survey. AI J. 229, 139\u2013174 (2015)","journal-title":"AI J."},{"key":"11_CR22","first-page":"95","volume":"186","author":"T Rahwan","year":"2012","unstructured":"Rahwan, T., Michalak, M.W.T., Jennings, N.: Anytime coalition structure generation in multi-agent systems with positive or negative externalities. AI J. 186, 95\u2013122 (2012)","journal-title":"AI J."},{"key":"11_CR23","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"229","author":"M Rothkopf","year":"1998","unstructured":"Rothkopf, M., Pekec, A., Harstad, R.: Computationally manageable combinational auctions. Manage. Sci. 229, 1131\u20131147 (1998)","journal-title":"Manage. Sci."},{"issue":"1\u20132","key":"11_CR24","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0004-3702(99)00036-3","volume":"111","author":"T Sandholm","year":"1999","unstructured":"Sandholm, T., Larson, K., Andersson, M., Shehory, O., Tohme, F.: Anytime coalition structure generation with worst case guarantees. Artif. Intell. 111(1\u20132), 209\u2013238 (1999)","journal-title":"Artif. Intell."},{"key":"11_CR25","doi-asserted-by":"crossref","unstructured":"Sen, S., Dutta, P.: Searching for optimal coalition structures. In: Proceedings of AAMAS, pp. 287\u2013292 (2000)","DOI":"10.1109\/ICMAS.2000.858465"},{"issue":"1\u20132","key":"11_CR26","first-page":"165","volume":"101","author":"O Shehory","year":"1998","unstructured":"Shehory, O., Kraus, S.: Methods for task allocation via agent coalition formation. AI J. 101(1\u20132), 165\u2013200 (1998)","journal-title":"AI J."},{"key":"11_CR27","first-page":"352","volume":"5","author":"A Sukstrienwong","year":"2011","unstructured":"Sukstrienwong, A.: Searching optimal buyer coalition structure by ant colony optimization. Int. J. Math. Comput. Simul. 5, 352\u2013360 (2011)","journal-title":"Int. J. Math. Comput. Simul."},{"issue":"4","key":"11_CR28","doi-asserted-by":"crossref","first-page":"467","DOI":"10.1007\/BF01935053","volume":"26","author":"D Yeh","year":"1986","unstructured":"Yeh, D.: A dynamic programming approach to the complete set partitioning problem. BIT Numer. Math. 26(4), 467\u2013474 (1986)","journal-title":"BIT Numer. Math."}],"container-title":["Lecture Notes in Computer Science","Multi-Agent Systems and Agreement Technologies"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-59294-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T22:44:14Z","timestamp":1750373054000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-59294-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319592930","9783319592947"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-59294-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}