{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T18:29:43Z","timestamp":1730226583163,"version":"3.28.0"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1109\/iat.2003.1241044","type":"proceedings-article","created":{"date-parts":[[2004,3,1]],"date-time":"2004-03-01T21:26:50Z","timestamp":1078176410000},"page":"25-31","source":"Crossref","is-referenced-by-count":2,"title":["On heuristics for solving winner determination problem in combinatorial auctions"],"prefix":"10.1109","author":[{"given":"M.","family":"Mito","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Fujita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352875"},{"key":"ref11","first-page":"90","article-title":"Improved algorithms for optimal winner determination in combinatorial auctions and generalizations","author":"sandholm","year":"2000","journal-title":"Proc AAAI"},{"key":"ref12","first-page":"1102","article-title":"CABOB: A fast optimal algorithm for combinatorial auctions","author":"sandholm","year":"2001","journal-title":"Proc IJCAI-01"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(01)00159-X"},{"key":"ref14","first-page":"607","article-title":"Limited discrepancy search","volume":"1","author":"harvey","year":"1995","journal-title":"Proc IJCAI'9S"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.7155\/jgaa.00020"},{"key":"ref3","first-page":"548","article-title":"Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches","author":"fujishima","year":"1999","journal-title":"Proc IJCAI'99"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/585265.585266"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.8.1131"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/352871.352879"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.15.3.284.16077"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90114-B"},{"key":"ref9","article-title":"A note on greedy algorithms for maximum weighted independent set problem","author":"sakai","year":"0","journal-title":"Discrete Applied Mathematics"}],"event":{"name":"2003 IEEE\/WIC International Conference on Intelligent Agent Technology","start":{"date-parts":[[2003,10,17]]},"location":"Halifax, NS","end":{"date-parts":[[2003,10,17]]}},"container-title":["IEEE\/WIC International Conference on Intelligent Agent Technology 2003 IAT 2003 IAT-03"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8789\/27820\/01241044.pdf?arnumber=1241044","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,13]],"date-time":"2017-03-13T21:22:51Z","timestamp":1489440171000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1241044\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/iat.2003.1241044","relation":{},"subject":[],"published":{"date-parts":[[2003]]}}}