{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:37:24Z","timestamp":1777451844043,"version":"3.51.4"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T00:00:00Z","timestamp":1499126400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61370156"],"award-info":[{"award-number":["61370156"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61503074"],"award-info":[{"award-number":["61503074"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61502464"],"award-info":[{"award-number":["61502464"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004602","name":"Program for New Century Excellent Talents in University","doi-asserted-by":"publisher","award":["NCET-13-0724"],"award-info":[{"award-number":["NCET-13-0724"]}],"id":[{"id":"10.13039\/501100004602","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Open Project Program of the State Key Laboratory of Mathematical Engineering and Advanced Computing","award":["2016A06"],"award-info":[{"award-number":["2016A06"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2017,10]]},"DOI":"10.1007\/s10732-017-9344-y","type":"journal-article","created":{"date-parts":[[2017,7,4]],"date-time":"2017-07-04T09:20:00Z","timestamp":1499160000000},"page":"367-396","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["An efficient local search algorithm for the winner determination problem"],"prefix":"10.1007","volume":"23","author":[{"given":"Haochen","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Shaowei","family":"Cai","sequence":"additional","affiliation":[]},{"given":"Chuan","family":"Luo","sequence":"additional","affiliation":[]},{"given":"Minghao","family":"Yin","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,4]]},"reference":[{"key":"9344_CR1","doi-asserted-by":"crossref","unstructured":"Andersson, A., Tenhunen, M., Ygge, F.: Integer programming for combinatorial auction winner determination. In: 4th International Conference on Multi-Agent Systems, ICMAS 2000, Boston, MA, USA, July 10\u201312, pp. 39\u201346 (2000)","DOI":"10.1109\/ICMAS.2000.858429"},{"issue":"2","key":"9344_CR2","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1016\/j.ejor.2006.12.068","volume":"186","author":"B Alidaee","year":"2008","unstructured":"Alidaee, B., Kochenberger, G.A., Lewis, K.R., Lewis, M.W., 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."},{"key":"9344_CR3","unstructured":"Ball, M., Donohue, G., Hoffman, K.: Auctions for the safe, efficient, and equitable allocation of airspace system resources. Comb. Auction 1, 507\u2013538 (2006)"},{"key":"9344_CR4","doi-asserted-by":"crossref","unstructured":"Boughaci, D.: Metaheuristic approaches for the winner determination problem in combinatorial auction. In: Artificial Intelligence, Evolutionary Computing and Metaheuristics\u2014In the Footsteps of Alan Turing, pp. 775\u2013791 (2013)","DOI":"10.1007\/978-3-642-29694-9_29"},{"key":"9344_CR5","doi-asserted-by":"crossref","unstructured":"Boughaci, D., Benhamou, B., Drias, H.: Stochastic local search for the optimal winner determination problem in combinatorial auctions. In: Principles and Practice of Constraint Programming, 14th International Conference, CP 2008, Sydney, Australia, September 14\u201318. Proceedings, pp. 593\u2013597 (2008)","DOI":"10.1007\/978-3-540-85958-1_48"},{"issue":"8\u20139","key":"9344_CR6","doi-asserted-by":"crossref","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(8\u20139), 905\u2013917 (2009)","journal-title":"Soft. Comput."},{"issue":"2","key":"9344_CR7","doi-asserted-by":"crossref","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"},{"key":"9344_CR8","unstructured":"Cai, S.: Balance between complexity and quality: Local search for minimum vertex cover in massive graphs. In: Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25\u201331, pp. 747\u2013753 (2015)"},{"key":"9344_CR9","unstructured":"Cai, S., Su, K.: Configuration checking with aspiration in local search for SAT. In: Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22\u201326, Toronto, ON, Canada (2012)"},{"key":"9344_CR10","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/j.artint.2013.09.001","volume":"204","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K.: Local search for boolean satisfiability with configuration checking and subscore. Artif. Intell. 204, 75\u201398 (2013)","journal-title":"Artif. Intell."},{"issue":"9\u201310","key":"9344_CR11","doi-asserted-by":"crossref","first-page":"1672","DOI":"10.1016\/j.artint.2011.03.003","volume":"175","author":"S Cai","year":"2011","unstructured":"Cai, S., Su, K., Sattar, A.: Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artif. Intell. 175(9\u201310), 1672\u20131696 (2011)","journal-title":"Artif. Intell."},{"key":"9344_CR12","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1613\/jair.3907","volume":"46","author":"S Cai","year":"2013","unstructured":"Cai, S., Su, K., Luo, C., Sattar, A.: NuMVC: an efficient local search algorithm for minimum vertex cover. J. Artif. Intell. Res. 46, 687\u2013716 (2013)","journal-title":"J. Artif. Intell. Res."},{"issue":"11","key":"9344_CR13","doi-asserted-by":"crossref","first-page":"2864","DOI":"10.1093\/comjnl\/bxu135","volume":"58","author":"S Cai","year":"2015","unstructured":"Cai, S., Luo, C., Su, K.: Improving walksat by effective tie-breaking and efficient implementation. Comput. J. 58(11), 2864\u20132875 (2015)","journal-title":"Comput. J."},{"issue":"2","key":"9344_CR14","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1162\/EVCO_a_00138","volume":"23","author":"CE Andrade de","year":"2015","unstructured":"de Andrade, C.E., Toso, R.F., Resende, M.G.C., Miyazawa, F.K.: Biased random-key genetic algorithms for the winner determination problem in combinatorial auctions. Evol. Comput. 23(2), 279\u2013307 (2015)","journal-title":"Evol. Comput."},{"issue":"3","key":"9344_CR15","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.dss.2008.10.009","volume":"46","author":"LF Escudero","year":"2009","unstructured":"Escudero, L.F., Landete, M., Mar\u00edn, A.: A branch-and-cut algorithm for the winner determination problem. Decis. Support Syst. 46(3), 649\u2013659 (2009)","journal-title":"Decis. Support Syst."},{"key":"9344_CR16","unstructured":"Fujishima, Y., Leyton-Brown, K., Shoham, Y.: Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, IJCAI 99, Stockholm, Sweden, July 31\u2013August 6, vol. 2, pp 548\u2013553 (1999)"},{"key":"9344_CR17","doi-asserted-by":"crossref","unstructured":"Gao, C., Weise, T., Li, J.: A weighting-based local search heuristic algorithm for the set covering problem. In: Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2014, Beijing, China, July 6\u201311, pp. 826\u2013831 (2014)","DOI":"10.1109\/CEC.2014.6900355"},{"issue":"3","key":"9344_CR18","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\u2013part I. ORSA J. Comput. 1(3), 190\u2013206 (1989)","journal-title":"ORSA J. Comput."},{"issue":"1","key":"9344_CR19","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F Glover","year":"1990","unstructured":"Glover, F.: Tabu search\u2013part II. ORSA J. Comput. 2(1), 4\u201332 (1990)","journal-title":"ORSA J. Comput."},{"key":"9344_CR20","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, 2179\u20132188 (2006)","journal-title":"Comput. Oper. Res."},{"key":"9344_CR21","unstructured":"Hoos, H.H., Boutilier, C.: Solving combinatorial auctions using stochastic local search. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30\u2013August 3, Austin, TX, USA, pp. 22\u201329 (2000)"},{"key":"9344_CR22","doi-asserted-by":"crossref","unstructured":"Lassouaoui, M., Boughaci, D.: A choice function hyper-heuristic for the winner determination problem. In: Nature Inspired Cooperative Strategies for Optimization (NICSO 2013)\u2014Learning, Optimization and Interdisciplinary Applications, Canterbury, UK, September 2\u20134, pp. 303\u2013314 (2013)","DOI":"10.1007\/978-3-319-01692-4_23"},{"key":"9344_CR23","unstructured":"Lau, H.C., Goh, Y.G.: An intelligent brokering system to support multi-agent web-based 4 th-party logistics. In: Proceedings of 14th IEEE International Conference on Tools with Artificial Intelligence, 2002 (ICTAI 2002), pp. 154\u2013161 (2002)"},{"key":"9344_CR24","doi-asserted-by":"crossref","unstructured":"Leyton-Brown, K., Pearson, M., Shoham, Y.: Towards a universal test suite for combinatorial auction algorithms. In: EC, pp. 66\u201376 (2000a)","DOI":"10.1145\/352871.352879"},{"key":"9344_CR25","unstructured":"Leyton-Brown, K., Shoham, Y., Tennenholtz, M.: An algorithm for multi-unit combinatorial auctions. In: Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on on Innovative Applications of Artificial Intelligence, July 30\u2013August 3, Austin, TX, USA, pp. 56\u201361 (2000b)"},{"key":"9344_CR26","unstructured":"Lin G, Zhu W, Ali M (2015) An effective discrete dynamic convexized method for solving the winner determination problem. J. Combin. Optim. 1\u201331"},{"key":"9344_CR27","doi-asserted-by":"crossref","unstructured":"Luo, C., Cai, S., Wu, W., Su, K.: Focused random walk with configuration checking and break minimum for satisfiability. In: Principles and Practice of Constraint Programming\u201419th International Conference, CP 2013, Uppsala, Sweden, September 16\u201320, 2013. Proceedings, pp 481\u2013496 (2013)","DOI":"10.1007\/978-3-642-40627-0_37"},{"key":"9344_CR28","unstructured":"Luo, C., Cai, S., Wu, W., Su, K.: Double configuration checking in stochastic local search for satisfiability. In: Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, July 27\u201331, 2014, Qu\u00e9bec City, Qu\u00e9bec, pp. 2703\u20132709 (2014)"},{"issue":"5","key":"9344_CR29","first-page":"1014","volume":"45","author":"C Luo","year":"2015","unstructured":"Luo, C., Cai, S., Su, K., Wu, W.: Clause states based configuration checking in local search for satisfiability. IEEE Trans. Cybern. 45(5), 1014\u20131027 (2015a)","journal-title":"IEEE Trans. Cybern."},{"issue":"7","key":"9344_CR30","doi-asserted-by":"crossref","first-page":"1830","DOI":"10.1109\/TC.2014.2346196","volume":"64","author":"C Luo","year":"2015","unstructured":"Luo, C., Cai, S., Wu, W., Jie, Z., Su, K.: CCLS: an efficient local search algorithm for weighted maximum satisfiability. IEEE Trans. Comput. 64(7), 1830\u20131843 (2015b)","journal-title":"IEEE Trans. Comput."},{"key":"9344_CR31","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.artint.2016.11.001","volume":"243","author":"C Luo","year":"2017","unstructured":"Luo, C., Cai, S., Su, K., Huang, W.: CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability. Artif. Intell. 243, 26\u201344 (2017)","journal-title":"Artif. Intell."},{"key":"9344_CR32","volume-title":"Theoretical Aspects of Local Search","author":"W Michiels","year":"2007","unstructured":"Michiels, W., Aarts, E.H.L., Korst, J.H.M.: Theoretical Aspects of Local Search. Springer, New York (2007)"},{"issue":"8","key":"9344_CR33","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., Peke\u010d, A., Harstad, R.M.: Computationally manageable combinational auctions. Manag. Sci. 44(8), 1131\u20131147 (1998)","journal-title":"Manag. Sci."},{"issue":"1\u20132","key":"9344_CR34","doi-asserted-by":"crossref","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."},{"issue":"1\u20132","key":"9344_CR35","doi-asserted-by":"crossref","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":"9344_CR36","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, Seattle, WA, USA, August 4\u201310, pp. 1102\u20131108 (2001)"},{"key":"9344_CR37","unstructured":"Selman, B., Kautz, H.A., Cohen, B.: Noise strategies for improving local search. In: Proceedings of the 12th National Conference on Artificial Intelligence, Seattle, July 31\u2013August 4, vol. 1, pp. 337\u2013343 (1994)"},{"key":"9344_CR38","doi-asserted-by":"crossref","unstructured":"Umetani, S.: Exploiting variable associations to configure efficient local search in large-scale set partitioning problems. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25\u201330, Austin, TX, USA, pp. 1226\u20131232 (2015)","DOI":"10.1609\/aaai.v29i1.9366"},{"issue":"2","key":"9344_CR39","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1016\/S0377-2217(98)00099-X","volume":"113","author":"C Voudouris","year":"1999","unstructured":"Voudouris, C., Tsang, E.P.K.: Guided local search and its application to the traveling salesman problem. Eur. J. Oper. Res. 113(2), 469\u2013499 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9344_CR40","doi-asserted-by":"crossref","unstructured":"Xu, K., Zhang, Y., Shi, X., Wang, H., Wang, Y., Shen, M,: Online combinatorial double auction for mobile cloud computing markets. In: IEEE 33rd International Performance Computing and Communications Conference, IPCCC 2014, Austin, TX, USA, December 5\u20137, pp. 1\u20138 (2014)","DOI":"10.1109\/PCCC.2014.7017103"},{"key":"9344_CR41","unstructured":"Zhang, Z., He, H., Luo, Z., Qin, H., Guo, S.: An efficient forest-based tabu search algorithm for the split-delivery vehicle routing problem. In: Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25\u201330, 2015, Austin, TX, USA, pp. 3432\u20133438 (2015)"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-017-9344-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9344-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-017-9344-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,7,30]],"date-time":"2022-07-30T12:16:50Z","timestamp":1659183410000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-017-9344-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,4]]},"references-count":41,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,10]]}},"alternative-id":["9344"],"URL":"https:\/\/doi.org\/10.1007\/s10732-017-9344-y","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,4]]}}}