{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:21:42Z","timestamp":1759666902132},"reference-count":17,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[2004,9,1]],"date-time":"2004-09-01T00:00:00Z","timestamp":1093996800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,9]]},"DOI":"10.1016\/s0305-0548(03)00112-6","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T22:48:19Z","timestamp":1054075699000},"page":"1635-1653","source":"Crossref","is-referenced-by-count":10,"title":["A column generation approach to the coalition formation problem in multi-agent systems"],"prefix":"10.1016","volume":"31","author":[{"given":"\u00d6nder","family":"Tombu\u015f","sequence":"first","affiliation":[]},{"given":"Taner","family":"Bilgi\u00e7","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(03)00112-6_BIB1","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1017\/S0269888900008122","article-title":"Intelligent agents","volume":"10","author":"Wooldridge","year":"1995","journal-title":"Knowledge Engineering Review"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB2","series-title":"Theories of coalition formation","author":"Kahan","year":"1984"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB3","series-title":"Rules of encounter: designing conventions for automated negotiation among computers","author":"Rosenschein","year":"1994"},{"issue":"1","key":"10.1016\/S0305-0548(03)00112-6_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/S0004-3702(97)00025-8","article-title":"Negotiation and cooperation in multi agent environments","volume":"94","author":"Kraus","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB5","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0004-3702(99)00036-3","article-title":"Coalition structure generation with worst case guarantees","volume":"111","author":"Sandholm","year":"1999","journal-title":"Artificial Intelligence"},{"issue":"12","key":"10.1016\/S0305-0548(03)00112-6_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1080\/095281300146290","article-title":"Anytime coalition structure generation","volume":"1","author":"Larson","year":"2000","journal-title":"Journal of Experimental and Theoretical AI"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB7","first-page":"14","article-title":"Agreement and coalition formation in multiagent-based virtual marketplaces","volume":"1821","author":"Brito","year":"2000","journal-title":"Lecture Notes in Artificial Intelligence"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB8","unstructured":"Zlotkin G, Rosenschein JS. Coalition, cryptography, and stability: mechanisms for coalition formation in task oriented domains. In: The National Conference on Artificial Intelligence, Seattle, WA, 1994. p. 432\u20137."},{"key":"10.1016\/S0305-0548(03)00112-6_BIB9","doi-asserted-by":"crossref","first-page":"710","DOI":"10.1137\/1018115","article-title":"Set partitioning","volume":"18","author":"Balas","year":"1976","journal-title":"SIAM Review"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB10","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0377-2217(94)00115-S","article-title":"Graph theoretic relaxations of set covering and set partioning problems","volume":"87","author":"El-Darzi","year":"1995","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0167-6377(98)00006-6","article-title":"Cliques and clustering","volume":"22","author":"Mehrotra","year":"1998","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB12","series-title":"Integer and combinatorial optimization","author":"Nemhauser","year":"1998"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB13","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","article-title":"Branch and price","volume":"46","author":"Barnhart","year":"1998","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB14","unstructured":"Ryan D, Foster B. An integer programming approach to scheduling. In: Wren A, editor. Computer scheduling of public transport urban passenger vehicle and crew scheduling. Amsterdam: Elsevier, 1981. p. 269\u201380."},{"issue":"8","key":"10.1016\/S0305-0548(03)00112-6_BIB15","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","article-title":"Computationally manageable combinational auctions","volume":"44","author":"Rothkoph","year":"1998","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00112-6_BIB16","unstructured":"de Vries S, Vohra R. Combinatorial auctions: a survey. Working paper, Northwestern University, Kellogg School of Management, 2001."},{"key":"10.1016\/S0305-0548(03)00112-6_BIB17","unstructured":"Sandholm T, Suri S. Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In: National Conference on Artificial Intelligence (AAAI), Austin, TX, 2000. p. 90\u20137."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001126?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001126?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:18Z","timestamp":1553158338000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001126"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,9]]},"references-count":17,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2004,9]]}},"alternative-id":["S0305054803001126"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00112-6","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,9]]}}}