{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:53:02Z","timestamp":1725551582057},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540304623"},{"type":"electronic","value":"9783540316527"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11589990_76","type":"book-chapter","created":{"date-parts":[[2005,11,26]],"date-time":"2005-11-26T01:28:03Z","timestamp":1132968483000},"page":"736-745","source":"Crossref","is-referenced-by-count":0,"title":["A Lagrangian Heuristic for Winner Determination Problem in Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiqing","family":"Tang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"76_CR1","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of the fourth International Conference on Multi-Agent Systems (ICMAS 2000), pp. 39\u201346 (2000)"},{"key":"76_CR2","first-page":"37","volume":"12","author":"E. Balas","year":"1980","unstructured":"Balas, E., Ho, A.: Set covering algorithms using cutting planes, heuristics, and subgradient optimization: a computational study. Mathematical Programming\u00a012, 37\u201360 (1980)","journal-title":"Mathematical Programming"},{"key":"76_CR3","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0377-2217(87)90141-X","volume":"31","author":"J.E. Beasley","year":"1987","unstructured":"Beasley, J.E.: An algorithm for set covering problem. European Journal of Operational Research\u00a031, 85\u201393 (1987)","journal-title":"European Journal of Operational Research"},{"issue":"5","key":"76_CR4","doi-asserted-by":"publisher","first-page":"730","DOI":"10.1287\/opre.47.5.730","volume":"47","author":"A. Caprara","year":"1999","unstructured":"Caprara, A., Fischetti, M., Toth, P.: A heuristic method for the set covering problem. Operations Research\u00a047(5), 730\u2013743 (1999)","journal-title":"Operations Research"},{"issue":"1","key":"76_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L.: The lagrangian relaxation method for solving integer programming problems. Management Science\u00a027(1), 1\u201318 (1981)","journal-title":"Management Science"},{"key":"76_CR6","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computatoinal complexity of combinatorial auctions: optimal and approximate approaches, pp. 548\u2013553 (1999)"},{"key":"76_CR7","doi-asserted-by":"crossref","unstructured":"G\u0171nl\u0171k, O., Lad\u00e1nyi, L., Vries, S.D.: A branch-and-price algorithm and new test problems for spectrum auctions. In: Management Science Special Issue - Electronic Markets (2004)","DOI":"10.1287\/mnsc.1040.0332"},{"key":"76_CR8","unstructured":"Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: Heuristics for a brokering set packing problem. In: 8th International Symposium on Artificial Intelligence and Mathematics (AIMA 2004) (2004)"},{"key":"76_CR9","unstructured":"Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: A non-exact approach and experiment studies on the combinatorial auction problem. In: Thirty-Eight Hawaii International Conference on System Sciences (HICSS-38) (2005)"},{"key":"76_CR10","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of American Association for Artificial Intelligence (AAAI 2000) (2000)"},{"key":"76_CR11","doi-asserted-by":"crossref","unstructured":"Karp, R.: Reducibility among combinatorial problems. Complexity of Computer Computations, 85\u2013103 (1972)","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"76_CR12","unstructured":"Lau, H.C., Goh, Y.G.: An intelligent brokering system to support multi-agent web-based 4th-party logistics. In: Proceedings of the 14th IEEE International Conference on Tools with Artificial Intelligence (ICTAI 2002) (2002)"},{"key":"76_CR13","unstructured":"Leyton-Brown, K., Nudelman, E., Andrew, G., McFaddan, J., Shoham, Y.: Boosting as a metaphor for algorithm design (working paper)"},{"key":"76_CR14","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: ACM conference on Electronic Commerce (EC 2000), pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"issue":"8","key":"76_CR15","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M.H. Rothkopf","year":"1998","unstructured":"Rothkopf, M.H., Peke\u010d, A., Harstad, R.M.: Computationally manageable combinatorial auctions. Management Science\u00a044(8), 1131\u20131147 (1998)","journal-title":"Management Science"},{"key":"76_CR16","unstructured":"Sandholm, T.: An algorithm for optimal winner determination in combinatorial auctions. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence (IJCAI 1999), pp. 542\u2013547 (1999)"},{"issue":"1-2","key":"76_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"2002","unstructured":"Sandholm, T.: Algorithm for optimal winner determination in combinatorial auctions. Artificial Intelligence\u00a0135(1-2), 1\u201354 (2002)","journal-title":"Artificial Intelligence"},{"key":"76_CR18","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Cabob: A fast optimal algorithm for combinatorial auctions. In: Proceedings of the Seventeenth International Joint Conference on Artificial Intelligence (IJCAI 2001), pp. 1102\u20131108 (2001)"},{"key":"76_CR19","volume-title":"Integer Programming","author":"L.A. Wolsey","year":"1998","unstructured":"Wolsey, L.A.: Integer Programming. John Wiley, Chichester (1998)"}],"container-title":["Lecture Notes in Computer Science","AI 2005: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11589990_76","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T14:04:03Z","timestamp":1558274643000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11589990_76"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540304623","9783540316527"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/11589990_76","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}