{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,26]],"date-time":"2026-01-26T15:37:26Z","timestamp":1769441846984,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":29,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642296932","type":"print"},{"value":"9783642296949","type":"electronic"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-29694-9_29","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T16:49:27Z","timestamp":1343321367000},"page":"775-791","source":"Crossref","is-referenced-by-count":16,"title":["Metaheuristic Approaches for the Winner Determination Problem in Combinatorial Auction"],"prefix":"10.1007","author":[{"given":"Dalila","family":"Boughaci","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"29_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 (July 2000)"},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1287\/ijoc.6.2.154","volume":"6","author":"J.C. Bean","year":"1994","unstructured":"Bean, J.C.: Genetics and random keys for sequencing and optimization. ORSA Journal of Computing\u00a06(2), 154\u2013160 (1994)","journal-title":"ORSA Journal of Computing"},{"issue":"2","key":"29_CR3","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\u00a09(2), 165\u2013180 (2010)","journal-title":"J. Math. Model. Algorithms"},{"issue":"8-9","key":"29_CR4","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 Computing\u00a013(8-9), 905\u2013917 (2009)","journal-title":"Soft Computing"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/978-3-540-85958-1_48","volume-title":"Principles and Practice of Constraint Programming","author":"D. Boughaci","year":"2008","unstructured":"Boughaci, D., Benhamou, B., Drias, H.: Stochastic Local Search for the Optimal Winner Determination Problem in Combinatorial Auctions. In: Stuckey, P.J. (ed.) CP 2008. LNCS, vol.\u00a05202, pp. 593\u2013597. Springer, Heidelberg (2008)"},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Boughaci, D., Drias, H., Benhamou, B.: Solving MAX-SAT problems using a Memetic Evolutionary Meta-Heuristic. In: Proceedings of the IEEE International conference on Cybernetics and Intelligent Systems, CIS 2004, pp. 480\u2013484 (December 2004)","DOI":"10.1109\/ICCIS.2004.1460462"},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/10720026_7","volume-title":"Agent Mediated Electronic Commerce II","author":"J. Collins","year":"2000","unstructured":"Collins, J., Sundareswara, R., Gini, M., Mobasher, B.: Bid Selection Strategies for Multi-Agent Contracting in the Presence of Scheduling Constraints. In: Moukas, A., Ygge, F., Sierra, C. (eds.) Agent Mediated Electronic Commerce II. LNCS, vol.\u00a01788, pp. 113\u2013130. Springer, Heidelberg (2000)"},{"key":"29_CR8","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":"29_CR9","unstructured":"Goldberg, D.E.: Genetic Algorithms in search Optimization and Machine Learning. Addison-Wesley, Wokingham (1989)"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Glover, F.: Future paths for integer programming and links to Artificial intelligence. Operational Search\u00a031 (1986)","DOI":"10.1016\/0305-0548(86)90048-1"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Glover, F.: \u201cTabu search\u201d: Part I. ORSA, Journal on Computing (1989)","DOI":"10.1287\/ijoc.1.3.190"},{"key":"29_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":"29_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. Computers and Operations Research\u00a033(8), 2179\u20132188 (2006)","journal-title":"Computers and Operations Research"},{"issue":"3-4","key":"29_CR14","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., O\u2019sullivan, B.: Towards Fast Vickrey Pricing using Constraint Programming. Artificial Intelligence Review\u00a021(3-4), 335\u2013352 (2004)","journal-title":"Artificial Intelligence Review"},{"key":"29_CR15","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":"29_CR16","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":"29_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1007\/978-3-540-24854-5_120","volume-title":"Genetic and Evolutionary Computation \u2013 GECCO 2004","author":"H. Ishibuchi","year":"2004","unstructured":"Ishibuchi, H., Narukawa, K.: Some issues on the implementation of local search in evolutionary multiobjective optimization. In: Deb, K., et al. (eds.) GECCO 2004, Part I. LNCS, vol.\u00a03102, pp. 1246\u20131258. Springer, Heidelberg (2004)"},{"issue":"2","key":"29_CR18","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1109\/TEVC.2003.810752","volume":"7","author":"H. Ishibuchi","year":"2003","unstructured":"Ishibuchi, H., Yoshida, T., Murata, T.: Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling. IEEE Transactions on Evolutionary Computation\u00a07(2), 204\u2013223 (2003)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"29_CR19","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, pp. 66\u201376 (2000)","DOI":"10.1145\/352871.352879"},{"key":"29_CR20","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 (2000)"},{"key":"29_CR21","first-page":"699","volume":"25","author":"R. McAfee","year":"1987","unstructured":"McAfee, R., McMillan, P.J.: Auctions and bidding. Journal of Economic Literature\u00a025, 699\u2013738 (1987)","journal-title":"Journal of Economic Literature"},{"key":"29_CR22","unstructured":"Moscato, P.: On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms. In: Caltech Concurrent Computation Program, C3P Report 826 (1989)"},{"key":"29_CR23","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/352871.352872","volume-title":"Proceedings of ACM Conference on Electronic Commerce (EC 2000)","author":"N. Nisan","year":"2000","unstructured":"Nisan, N.: Bidding and allocation in combinatorial auctions. In: Proceedings of ACM Conference on Electronic Commerce (EC 2000), pp. 1\u201312. ACM SIGecom, ACM Press, Minneapolis (2000)"},{"issue":"8","key":"29_CR24","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., Pekee, A., Ronald, M.: Computationally manageable combinatorial auctions. Management Science\u00a044(8), 1131\u20131147 (1998)","journal-title":"Management Science"},{"issue":"1-2","key":"29_CR25","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0004-3702(01)00159-X","volume":"135","author":"T. Sandholm","year":"1999","unstructured":"Sandholm, T.: Algorithms for Optimal Winner Determination in Combinatorial Auctions. Artificial Intelligence\u00a0135(1-2), 1\u201354 (1999)","journal-title":"Artificial Intelligence"},{"key":"29_CR26","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":"29_CR27","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":"29_CR28","doi-asserted-by":"crossref","unstructured":"Sandholm, T.: Optimal Winner Determination Algorithms. In: Cramton, P., et al. (eds.) Combinatorial Auctions. MIT Press (2006)","DOI":"10.7551\/mitpress\/9780262033428.003.0015"},{"key":"29_CR29","doi-asserted-by":"publisher","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S. de Vries","year":"2003","unstructured":"de Vries, S., Vohra, R.: Combinatorial auctions a survey. INFORMS Journal of Computing\u00a015, 284\u2013309 (2003)","journal-title":"INFORMS Journal of Computing"}],"container-title":["Studies in Computational Intelligence","Artificial Intelligence, Evolutionary Computing and Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29694-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,5]],"date-time":"2025-04-05T14:30:54Z","timestamp":1743863454000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-29694-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642296932","9783642296949"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29694-9_29","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"value":"1860-949X","type":"print"},{"value":"1860-9503","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}