{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T08:10:07Z","timestamp":1751443807245,"version":"3.41.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319774480"},{"type":"electronic","value":"9783319774497"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-77449-7_12","type":"book-chapter","created":{"date-parts":[[2018,3,2]],"date-time":"2018-03-02T10:27:00Z","timestamp":1519986420000},"page":"174-188","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Ant Colony Approach for the Winner Determination Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9963-1918","authenticated-orcid":false,"given":"Abhishek","family":"Ray","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Ventresca","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,3,3]]},"reference":[{"issue":"4","key":"12_CR1","doi-asserted-by":"publisher","first-page":"688","DOI":"10.1287\/isre.1100.0316","volume":"21","author":"M Bichler","year":"2010","unstructured":"Bichler, M., Gupta, A., Ketter, W.: Research commentary - designing smart markets. Inf. Syst. Res. 21(4), 688\u2013699 (2010)","journal-title":"Inf. Syst. Res."},{"key":"12_CR2","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/0-306-48056-5_9","volume-title":"Handbook of Metaheuristics","author":"M Dorigo","year":"2003","unstructured":"Dorigo, M., S\u00fcttzle, T.: The ant colony optimization metaheuristic: algorithms, applications, and advances. In: Glover, F., Kochenberger, G.A. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol. 57, pp. 251\u2013286. Springer, Boston (2003). https:\/\/doi.org\/10.1007\/0-306-48056-5_9"},{"key":"12_CR3","doi-asserted-by":"crossref","unstructured":"Gan, R., Guo, Q., Chang, H., Yi, Y.: Ant colony optimization for winner determination in combinatorial auctions. In: Third International Conference on Natural Computation, ICNC 2007, vol. 4, pp. 441\u2013445. IEEE, August 2007","DOI":"10.1109\/ICNC.2007.242"},{"issue":"8","key":"12_CR4","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"WJ Gutjahr","year":"2000","unstructured":"Gutjahr, W.J.: A graph-based ant system and its convergence. Future Gener. Comput. Syst. 16(8), 873\u2013888 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Stutzle, T., Hoos, H.: MAX-MIN ant system and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation, pp. 309\u2013314. IEEE, April 1997","DOI":"10.1109\/ICEC.1997.592327"},{"issue":"3","key":"12_CR6","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. Manag. Sci. 51(3), 374\u2013390 (2005)","journal-title":"Manag. Sci."},{"key":"12_CR7","unstructured":"Lau, H.C., Goh, Y.G.: An intelligent brokering system to support multi-agent Web-based 4\/sup th\/-party logistics. In: Proceedings of 14th IEEE International Conference on Tools with Artificial Intelligence, ICTAI 2002, pp. 154\u2013161. IEEE (2002)"},{"issue":"1\u20132","key":"12_CR8","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. Artif. Intell. 135(1\u20132), 1\u201354 (2002)","journal-title":"Artif. Intell."},{"key":"12_CR9","doi-asserted-by":"crossref","unstructured":"Sandholm, T., Suri, S., Gilpin, A., Levine, D.: Winner determination in combinatorial auction generalizations. In: Proceedings of the First International Joint Conference on Autonomous Agents and Multiagent Systems: Part 1, pp. 69\u201376. ACM, July 2002","DOI":"10.1145\/544757.544760"},{"key":"12_CR10","unstructured":"Sandholm, T., Suri, S.: Improved algorithms for optimal winner determination in combinatorial auctions and generalizations. In: AAAI\/IAAI, pp. 90\u201397, July 2000"},{"issue":"1\u20132","key":"12_CR11","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(1\u20132), 33\u201358 (2003)","journal-title":"Artif. Intell."},{"key":"12_CR12","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: IJCAI, vol. 99, pp. 548\u2013553, July 1999"},{"key":"12_CR13","unstructured":"Leyton-Brown, K., Shoham, Y., Tennenholtz, M.: An algorithm for multi-unit combinatorial auctions. In: AAAI\/IAAI pp. 56\u201361, July 2000"},{"issue":"8","key":"12_CR14","doi-asserted-by":"publisher","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"MH Rothkopf","year":"1998","unstructured":"Rothkopf, M.H., Peke, A., Harstad, R.M.: Computationally manageable combinational auctions. Manag. Sci. 44(8), 1131\u20131147 (1998)","journal-title":"Manag. Sci."},{"key":"12_CR15","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: Proceedings of Fourth International Conference on MultiAgent Systems, pp. 39\u201346. IEEE (2000)"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Holland, A., O\u2019Sullivan, B.: Robust solutions for combinatorial auctions. In: Proceedings of the 6th ACM Conference on Electronic Commerce, pp. 183\u2013192. ACM, June 2005","DOI":"10.1145\/1064009.1064029"},{"issue":"8","key":"12_CR17","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":"12_CR18","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: AAAI\/IAAI, pp. 22\u201329, July 2000"},{"issue":"2","key":"12_CR19","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(2), 165\u2013180 (2010)","journal-title":"J. Math. Model. Algorithms"},{"issue":"8","key":"12_CR20","first-page":"905","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.-Fusion Found. Methodol. Appl. 13(8), 905\u2013917 (2009)","journal-title":"Soft Comput.-Fusion Found. Methodol. Appl."},{"key":"12_CR21","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A., Maniezzo, V.: Positive feedback as a search strategy (1991)"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Dorigo, M., Di Caro, G.: Ant colony optimization: a new meta-heuristic. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999, vol. 2, pp. 1470\u20131477. IEEE (1999)","DOI":"10.1109\/CEC.1999.782657"},{"issue":"4","key":"12_CR23","doi-asserted-by":"publisher","first-page":"545","DOI":"10.1017\/S0269964803174086","volume":"17","author":"WJ Gutjahr","year":"2003","unstructured":"Gutjahr, W.J.: A generalized convergence result for the graph-based ant system metaheuristic. Probab. Eng. Inf. Sci. 17(4), 545\u2013569 (2003)","journal-title":"Probab. Eng. Inf. Sci."},{"issue":"8","key":"12_CR24","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Sttzle","year":"2000","unstructured":"Sttzle, T., Hoos, H.H.: MAX-MIN ant system. Future Gener. Comput. Syst. 16(8), 889\u2013914 (2000)","journal-title":"Future Gener. Comput. Syst."},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: Proceedings of the 2nd ACM Conference on Electronic Commerce, pp. 66\u201376. ACM, October 2000","DOI":"10.1145\/352871.352879"},{"issue":"2","key":"12_CR26","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"186","author":"B Alidaee","year":"2008","unstructured":"Alidaee, B., Kochenberger, G., Lewis, K., Lewis, M., Wang, H.: A new approach for modeling and solving set packing problems. Eur. J. Oper. Res. 186(2), 504\u2013512 (2008)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"12_CR27","first-page":"73","volume":"4","author":"DP Porter","year":"1999","unstructured":"Porter, D.P.: The effect of bid withdrawal in a multi-object auction. Rev. Econ. Des. 4(1), 73\u201397 (1999)","journal-title":"Rev. Econ. Des."},{"issue":"1","key":"12_CR28","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1147\/sj.311.0004","volume":"31","author":"DG Wilson","year":"1992","unstructured":"Wilson, D.G., Rudin, B.D.: Introduction to the IBM optimization subroutine library. IBM Syst. J. 31(1), 4\u201310 (1992)","journal-title":"IBM Syst. J."}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77449-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,2]],"date-time":"2025-07-02T07:44:55Z","timestamp":1751442295000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-77449-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319774480","9783319774497"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77449-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"3 March 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoCOP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Evolutionary Computation in Combinatorial Optimization","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Parma","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 April 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 April 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evocop2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.evostar.org\/2018\/cfp_evocop.php","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}