{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T19:11:51Z","timestamp":1710357111179},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2010,2,10]],"date-time":"2010-02-10T00:00:00Z","timestamp":1265760000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2010,6]]},"DOI":"10.1007\/s10852-010-9127-z","type":"journal-article","created":{"date-parts":[[2010,2,9]],"date-time":"2010-02-09T08:10:20Z","timestamp":1265703020000},"page":"165-180","source":"Crossref","is-referenced-by-count":27,"title":["Local Search Methods for the Optimal Winner Determination Problem in Combinatorial Auctions"],"prefix":"10.1007","volume":"9","author":[{"given":"Dalila","family":"Boughaci","sequence":"first","affiliation":[]},{"given":"Bela\u00efd","family":"Benhamou","sequence":"additional","affiliation":[]},{"given":"Habiba","family":"Drias","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,2,10]]},"reference":[{"key":"9127_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of 4th International Conference on Multi-Agent Systems, pp. 39\u201346. IEEE Computer Society, July 2000","DOI":"10.1109\/ICMAS.2000.858429"},{"issue":"2","key":"9127_CR2","doi-asserted-by":"crossref","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"JC Bean","year":"1994","unstructured":"Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA J. Comput. 6(2), 154\u2013160 (1994)","journal-title":"ORSA J. Comput"},{"key":"9127_CR3","doi-asserted-by":"crossref","unstructured":"Boughaci, D., Drias, H., Benhamou, B.: Stochastic local search for the optimal winner determination problem in combinatorial auctions. In: The International Conference on Constraint Programming, CP 2008. LNCS, pp. 593\u2013597 (2008)","DOI":"10.1007\/978-3-540-85958-1_48"},{"key":"9127_CR4","first-page":"905","volume-title":"Soft Computing\u2014a Fusion of Foundations, Methodologies and Applications, vol. 13, no. 8\u20139","author":"D Boughaci","year":"2008","unstructured":"Boughaci, D., Drias, H., Benhamou, B.: A memetic algorithm for the optimal winner determination problem. In: Soft Computing\u2014a Fusion of Foundations, Methodologies and Applications, vol. 13, no. 8\u20139, pp. 905\u2013917. Springer, Berlin (2008)"},{"key":"9127_CR5","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: Sixteenth International Joint Conference on Artificial Intelligence, pp. 48\u201353 (1999)"},{"key":"9127_CR6","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover, F.: Future paths for integer programming and links to artificial intelligence. Comput. Oper. Res. 13, 533\u2013549 (1986)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"9127_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F Glover","year":"1989","unstructured":"Glover, F.: Tabu search: part I. ORSA J. Comput. 1(3):190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"key":"9127_CR8","unstructured":"Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: Heuristics for a brokering set packing problem. In: Proceedings of eighth international symposium on artificial intelligence and mathematics, pp. 10\u201314 (2004)"},{"issue":"8","key":"9127_CR9","doi-asserted-by":"crossref","first-page":"2179","DOI":"10.1016\/j.cor.2005.01.007","volume":"33","author":"Y Guo","year":"2006","unstructured":"Guo, Y., Lim, A., Rodrigues, B., Zhu, Y.: Heuristics for a bidding problem. Comput. Oper. Res. 33(8), 2179\u20132188 (2006)","journal-title":"Comput. Oper. Res"},{"issue":"3\u20134","key":"9127_CR10","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/B:AIRE.0000036262.43475.22","volume":"21","author":"A Holland","year":"2004","unstructured":"Holland, A., O\u2019sullivan, B.: Towards fast Vickrey pricing using constraint programming. Artif. Intell. Rev. 21(3\u20134), 335\u2013352 (2004)","journal-title":"Artif. Intell. Rev"},{"key":"9127_CR11","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 22\u201329 (2000)"},{"key":"9127_CR12","unstructured":"Hoos, H.H.: An adaptive noise mechanism for WalkSAT. In: Proceedings of the 19th National Conference on Artificial Intelligence AAAI\/IAAI 2002, pp. 655\u2013660 (2002)"},{"key":"9127_CR13","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 International Conference on Tools with Artificial Intelligence, pp. 54\u201361 (2002)"},{"key":"9127_CR14","unstructured":"Leyton-Brown, K., Tennenholtz, M., Shoham, Y.: An algorithm for multi-unit combinatorial auctions. In: Proceedings of the 17th National Conference on Artificial Intelligence, Austin, Games-2000, Bilbao, and ISMP-2000, Atlanta (2000b)"},{"key":"9127_CR15","first-page":"699","volume":"25","author":"R McAfee","year":"1987","unstructured":"McAfee, R., McMillan, P.J.: Auctions and bidding. J. Econ. Lit. 25, 699\u2013738 (1987)","journal-title":"J. Econ. Lit"},{"key":"9127_CR16","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of ACM Conference on Electronic Commerce (EC\u201900), pp. 1\u201312. Minneapolis: ACM SIGecom, ACM, October (2000)","DOI":"10.1145\/352871.352872"},{"issue":"8","key":"9127_CR17","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"MH Rothkopf","year":"1998","unstructured":"Rothkopf, M.H., Pekee, A., Ronald, M.: Computationally manageable combinatorial auctions. Manage. Sci. 44(8), 1131\u20131147 (1998)","journal-title":"Manage. Sci"},{"issue":"1\u20132","key":"9127_CR18","first-page":"1","volume":"135","author":"T Sandholm","year":"1999","unstructured":"Sandholm, T.: Algorithms for optimal winner determination in combinatorial auctions. Artif. Intell. 135(1\u20132), 1\u201354 (1999)","journal-title":"Artif. Intell."},{"key":"9127_CR19","volume-title":"Combinatorial Auctions","author":"T Sandholm","year":"2006","unstructured":"Sandholm, T.: Optimal winner determination algorithms. In: Cramton, P., et al. (ed.), Combinatorial Auctions. MIT, Cambridge (2006)"},{"key":"9127_CR20","unstructured":"Sandholm, T., Suri, S.: Improved optimal algorithm for combinatorial auctions and generalizations. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 90\u201397 (2000)"},{"key":"9127_CR21","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABoB: a fast optimal algorithm for combinatorial auctions. In: Proceedings of the International Joint Conferences on Artificial Intelligence, pp. 1102\u20131108 (2001)"},{"key":"9127_CR22","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"Vries de, S., Vohra, R.: Combinatorial auctions a survey. INFORMS J. Comput. 15, 284\u2013309 (2003)","journal-title":"INFORMS J. Comput"}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9127-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-010-9127-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-010-9127-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:26:31Z","timestamp":1559269591000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-010-9127-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,2,10]]},"references-count":22,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,6]]}},"alternative-id":["9127"],"URL":"https:\/\/doi.org\/10.1007\/s10852-010-9127-z","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,2,10]]}}}