{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T04:29:24Z","timestamp":1743049764876,"version":"3.40.3"},"publisher-location":"New Delhi","reference-count":33,"publisher":"Springer India","isbn-type":[{"type":"print","value":"9788132217671"},{"type":"electronic","value":"9788132217688"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-81-322-1768-8_52","type":"book-chapter","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T00:11:09Z","timestamp":1393891869000},"page":"589-599","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Local Search Methods for the Winner Determination Problem in Multi-Unit Combinatorial Auctions"],"prefix":"10.1007","author":[{"given":"Abdellah","family":"Rezoug","sequence":"first","affiliation":[]},{"given":"Dalila","family":"Boughaci","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,4]]},"reference":[{"key":"52_CR1","unstructured":"Anderson, 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 Press (2000)"},{"issue":"2","key":"52_CR2","doi-asserted-by":"publisher","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":"52_CR3","doi-asserted-by":"crossref","unstructured":"Boughaci, D.: Metaheuristic approaches for the winner determination problem in combinatorial auction. In: Artificial Intelligence, Evolutionary Computing and Metaheuristics, pp. 775\u2013791. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-29694-9_29"},{"key":"52_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/s10852-010-9127-z","volume":"9","author":"D Boughaci","year":"2010","unstructured":"Boughaci, D., Benhamou, B., Drias, H.: Local search methods for the optimal winner determination problem in combinatorial auctions. J. Math. Model. Algorithms 9, 165\u2013180 (2010)","journal-title":"J. Math. Model. Algorithms"},{"key":"52_CR5","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1007\/s00500-008-0355-3","volume":"13","author":"D Boughaci","year":"2009","unstructured":"Boughaci, D., Benhamou, B., Drias, H.: A memetic algorithm for the optimal winner determination problem. Soft. Comput. 13, 905\u2013917 (2009)","journal-title":"Soft. Comput."},{"key":"52_CR6","unstructured":"Caplice, CG.: An optimization based bidding process: a new framework for shipper carrier relationships. Ph.D. thesis, Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA (1996)"},{"key":"52_CR7","doi-asserted-by":"crossref","unstructured":"Chen, L., Hu, S., Chen, X., Lin. Y.: Hybrid algorithm for winner determination problem in combinatorial auctions. In: International Conference on Computational Intelligence and Security, pp. 82\u201386 (2008)","DOI":"10.1109\/CIS.2008.96"},{"issue":"4","key":"52_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.3923\/jas.2010.291.297","volume":"10","author":"S Farzi","year":"2010","unstructured":"Farzi, S.: Discrete quantum-behaved particle swarm optimization for the multi-unit combinatorial auction determination problem. J. Appl. Sci. 10(4), 291\u2013297 (2010)","journal-title":"J. Appl. Sci."},{"key":"52_CR9","unstructured":"Fujishima,Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: Optimal and approximate approaches. In: Proceedings of IJCAI\u201399 (1999)"},{"key":"52_CR10","doi-asserted-by":"publisher","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."},{"key":"52_CR11","doi-asserted-by":"crossref","unstructured":"Gonen, R., Lehmann, D.: Linear programming helps solving large multi-unit combinatorial auctions (2001)","DOI":"10.1145\/352871.352873"},{"key":"52_CR12","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":"52_CR13","doi-asserted-by":"publisher","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."},{"key":"52_CR14","doi-asserted-by":"crossref","unstructured":"Guo,Y., Lim, A., Rodrigues, B., Tang, J.: Using a Lagrangian heuristic for a combinatorial auction problem. Int. J. Artif. Intell. Tools La-grange-IJAIT, 21\u201334 (2006)","DOI":"10.1142\/S0218213006002771"},{"issue":"5","key":"52_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1287\/inte.23.5.81","volume":"23","author":"RL Graves","year":"1993","unstructured":"Graves, R.L., Schrage, L., Sankaran, J.K.: An auction method for course registration. Interfaces 23(5), 81\u201392 (1993)","journal-title":"Interfaces"},{"key":"52_CR16","doi-asserted-by":"crossref","unstructured":"Hansen, P., Mladenovic, N.: An introduction to variable neighborhood search. In: Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization, pp. 433\u2013458. Kluwer Academic Publishers, Boston (1999)","DOI":"10.1007\/978-1-4615-5775-3_30"},{"key":"52_CR17","unstructured":"Hoos, H.H.,Craig, B.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp. 22\u201329 (2000)"},{"key":"52_CR18","volume-title":"Stochastic local search: foundations and applications","author":"HH Hoos","year":"2004","unstructured":"Hoos, H.H., Stutzle, T.: Stochastic local search: foundations and applications. Morgan Kaufmann Publishers, Burlington (2004)"},{"issue":"34","key":"52_CR19","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1023\/B:AIRE.0000036262.43475.22","volume":"21","author":"A Holland","year":"2004","unstructured":"Holland, A., Osullivan, B.: Towards fast vickrey pricing using constraint programming. Artif. Intell. 21(34), 335\u2013352 (2004)","journal-title":"Artif. Intell."},{"key":"52_CR20","unstructured":"ILOG CPLEX optimization studio 12.5"},{"key":"52_CR21","unstructured":"Jackson, C.: Technology for spectrum markets. Ph.D. thesis, Department of Electrical Engineering, Massachusetts Institute of Technology, Cambridge, MA, USA (1976)"},{"key":"52_CR22","unstructured":"Jones, JL.: Incompletely specified combinatorial auction: an alternative allocation mechanism for business-to-business negotiations. Ph.D. thesis, Warrington College of Business Administration, University of Florida, Gainesville, FL, USA (2000)"},{"key":"52_CR23","doi-asserted-by":"crossref","unstructured":"Kameshwaran, S., Benyoucef, L.: Branch on price: a fast winner determination algorithm for discount auctions. In: Cheng, S.-W., Poon C.K. (eds.) AAIM 2006, LNCS 4041, pp. 375\u2013386. Springer, Berlin (2006)","DOI":"10.1007\/11775096_35"},{"key":"52_CR24","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.dss.2008.10.009","volume":"46","author":"F Laureano","year":"2009","unstructured":"Laureano, F.: Escudero, Mercedes Landete, Alfredo Marn: a branch-and-cut algorithm for the winner determination problem. Decis. Support Syst. 46, 649\u2013659 (2009)","journal-title":"Decis. Support Syst."},{"key":"52_CR25","unstructured":"Leyton Brown, K., Shoham, Y., Tennenholtz, M.: An algorithm for multi-unit combinatorial auctions. In: Proceedings of the National Conference on Artificial Intelligence (AAAI-00), pp. 56\u201361. Austin, Texas, US (2000)"},{"key":"52_CR26","doi-asserted-by":"crossref","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of the ACM Conference on Electronic Commerce (EC-00), pp. 1\u201312. Minneapolis, US, Oct 2000","DOI":"10.1145\/352871.352872"},{"issue":"2","key":"52_CR27","doi-asserted-by":"publisher","first-page":"402","DOI":"10.2307\/3003463","volume":"13","author":"SJ Rassenti","year":"1982","unstructured":"Rassenti, S.J., Smith, V.L., Bulfin, R.L.: A combinatorial auction mechanism for airport time slot allocation. Bell J. Econ. 13(2), 402\u2013417 (1982)","journal-title":"Bell J. Econ."},{"issue":"8","key":"52_CR28","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"M Rothkopf","year":"1998","unstructured":"Rothkopf, M., Pekee, A., Harstad, R.: Computationally manageable combinational auctions. Manage. Sci. 44(8), 1131\u20131147 (1998)","journal-title":"Manage. Sci."},{"issue":"4","key":"52_CR29","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1287\/inte.1040.0075","volume":"34","author":"Y Sheffi","year":"2004","unstructured":"Sheffi, Y.: Combinatorial auctions in the procurement of transportation services. Interfaces 34(4), 245\u2013252 (2004)","journal-title":"Interfaces"},{"key":"52_CR30","unstructured":"Singh, R.J., Sen, A.K., Sarkar, U.K.: A partitioned stochastic search algorithm: application to multi-unit winner determination problem in combinatorial auction. In: Proceedings of Athens: ATINER\u2019S Conference Paper Series, No: COM2012\u20130261 (2012)"},{"key":"52_CR31","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/S0004-3702(03)00015-8","volume":"145","author":"T Sandholm","year":"2003","unstructured":"Sandholm, T., Suri, S.: BOB: improved winner determination in combinatorial auctions and generalizations. Artif. Intell. 145, 33\u201358 (2003)","journal-title":"Artif. Intell."},{"issue":"3","key":"52_CR32","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1287\/mnsc.1040.0336","volume":"51","author":"T Sandholm","year":"2005","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: CABOB: a fast optimal algorithm for winner determination in combinatorial auctions. Manage. Sci. 51(3), 374\u2013390 (2005)","journal-title":"Manage. Sci."},{"key":"52_CR33","doi-asserted-by":"crossref","unstructured":"Zheng, G., Lin, Z.C.: A Winner determination algorithm for combinatorial auctions based on hybrid artificial fish swarm algorithm. Physics Procedia, 1666\u20131670, International Conference on Solid State Devices and Materials Science (2012)","DOI":"10.1016\/j.phpro.2012.03.292"}],"container-title":["Advances in Intelligent Systems and Computing","Proceedings of the Third International Conference on Soft Computing for Problem Solving"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-81-322-1768-8_52","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,19]],"date-time":"2023-02-19T23:14:52Z","timestamp":1676848492000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-81-322-1768-8_52"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9788132217671","9788132217688"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-81-322-1768-8_52","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"4 March 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}