{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,6]],"date-time":"2025-10-06T05:58:55Z","timestamp":1759730335743,"version":"3.28.0"},"reference-count":10,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/tai.2003.1250210","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"346-350","source":"Crossref","is-referenced-by-count":4,"title":["Task allocation via multi-agent coalition formation: taxonomy, algorithms and complexity"],"prefix":"10.1109","author":[{"family":"Hoong Chuin Lau","sequence":"first","affiliation":[]},{"family":"Lei Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","first-page":"415","article-title":"On the Existence of Fast Approximation Schemes","volume":"4","author":"korte","year":"1981","journal-title":"Nonlinear Programming"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/375735.376452"},{"journal-title":"Introduction to Combinational Mathematics Readings","year":"1968","author":"liu","key":"ref6"},{"key":"ref5","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","article-title":"Sequencing and Scheduling: Algorithms and Complexity","volume":"4","author":"lawler","year":"1993","journal-title":"Handbooks in Operations Research\/Management Science"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00045-9"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(99)00036-3"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(84)90053-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1111\/0824-7935.00092"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(76)90048-7","article-title":"Approximation Algorithm for Some Generalized Knapsack Problems","volume":"3","author":"ashok","year":"1976","journal-title":"Theo Comp Sci"}],"event":{"name":"15th IEEE International Conference on Tools with Artificial Intelligence","acronym":"TAI-03","location":"Sacramento, CA, USA"},"container-title":["Proceedings. 15th IEEE International Conference on Tools with Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8840\/27974\/01250210.pdf?arnumber=1250210","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:05:50Z","timestamp":1497585950000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1250210\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/tai.2003.1250210","relation":{},"subject":[]}}