{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,30]],"date-time":"2024-08-30T11:41:31Z","timestamp":1725018091919},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2015,4,28]],"date-time":"2015-04-28T00:00:00Z","timestamp":1430179200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2016,8]]},"DOI":"10.1007\/s10878-015-9883-9","type":"journal-article","created":{"date-parts":[[2015,4,27]],"date-time":"2015-04-27T09:08:52Z","timestamp":1430125732000},"page":"563-593","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["An effective discrete dynamic convexized method for solving the winner determination problem"],"prefix":"10.1007","volume":"32","author":[{"given":"Geng","family":"Lin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wenxing","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"M. Montaz","family":"Ali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,4,28]]},"reference":[{"issue":"1","key":"9883_CR1","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.ejor.2003.06.022","volume":"160","author":"J Abrache","year":"2005","unstructured":"Abrache J, Crainic TG, Gendreau M (2005) Models for bundle trading in financial markets. Eur J Oper Res 160(1):88\u2013105","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9883_CR2","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/s10589-012-9498-3","volume":"54","author":"MM Ali","year":"2013","unstructured":"Ali MM, Zhu WX (2013) A penalty function-based differential evolution algorithm for constrained global optimization. Comput Optim Appl 54(3):707\u2013739","journal-title":"Comput Optim Appl"},{"key":"9883_CR3","doi-asserted-by":"crossref","unstructured":"Andersson A, Tenhunen M, Ygge F (2000) Integer programming for combinatorial auction winner determination. In: Proceedings of 4th international conference on multi-agent system, IEEE computer Society Press, New York, pp 39\u201346","DOI":"10.1109\/ICMAS.2000.858429"},{"key":"9883_CR4","unstructured":"Avasarala V, Mullen T, Hall DL, Garga A (2005) MASM: a market architecture or sensor management in distributed sensor networks. In: SPIE Defense and Security Symposium, Orlando FL, pp 5813\u20135830"},{"key":"9883_CR5","doi-asserted-by":"crossref","unstructured":"Avasarala V, Pllavarapu H, Mullen T (2006) An approximate algorithm for resource allocation using combinatorial auctions. In: International Conference on Intelligent Agent Technology, pp 571\u2013578","DOI":"10.1109\/IAT.2006.33"},{"key":"9883_CR6","volume-title":"Combinatorial auctions","author":"M Ball","year":"2006","unstructured":"Ball M, Donohue G, Hoffman K (2006) Auctions for the safe, efficient and equitable allocation of airspace system resources. In: Steinberg R, Cramton P, Shoham Y (eds) Combinatorial auctions, vol 22. MIT, Cambridge"},{"key":"9883_CR7","doi-asserted-by":"crossref","first-page":"775","DOI":"10.1007\/978-3-642-29694-9_29","volume":"427","author":"D Boughaci","year":"2013","unstructured":"Boughaci D (2013) Metaheuristic approaches for the winner determination problem in combinatorial auction. Artif Intell Evolut Comput Metaheuristics 427:775\u2013791","journal-title":"Artif Intell Evolut Comput Metaheuristics"},{"issue":"8\u20139","key":"9883_CR8","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 (2009) A memetic algorithm for the optimal winner determination problem. Soft Comput 13(8\u20139):905\u2013917","journal-title":"Soft Comput"},{"issue":"3","key":"9883_CR9","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1287\/ijoc.15.3.284.16077","volume":"15","author":"S Vries de","year":"2003","unstructured":"de Vries S, Vohra R (2003) Combinatorial auctions: a survey. INFORMS J Comput 15(3):284\u2013309","journal-title":"INFORMS J Comput"},{"issue":"3","key":"9883_CR10","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1016\/j.dss.2008.10.009","volume":"46","author":"LF Escudero","year":"2009","unstructured":"Escudero LF, Landete M, Mar\u00edn A (2009) A branch-and-cut algorithm for the winner determination problem. Decis Support Syst 46(3):649\u2013659","journal-title":"Decis Support Syst"},{"key":"9883_CR11","doi-asserted-by":"crossref","unstructured":"Fiduccia CM, Mattheyses RM (1982) A linear time heuristic for improving network partitions. In: Proceedings of 19th ACM\/IEEE Design Automation Conference, Las Vegas, NV, pp 175\u2013181","DOI":"10.1109\/DAC.1982.1585498"},{"key":"9883_CR12","unstructured":"Fuishima Y, Leyton-Brown K, Shoham Y (1999) Taming the computational complexity of combinatorial auctions: optimal and approximate approaches. In: Sixteenth International Joint Conference on Artificial Intelligence, pp 48\u201353"},{"issue":"8","key":"9883_CR13","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 (2006) Heuristics for a bidding problem. Comput Oper Res 33(8):2179\u20132188","journal-title":"Comput Oper Res"},{"issue":"1","key":"9883_CR14","doi-asserted-by":"crossref","first-page":"1","DOI":"10.7155\/jgaa.00020","volume":"4","author":"MM Halld\u00f3rsson","year":"2000","unstructured":"Halld\u00f3rsson MM (2000) Approximations of weighted independent set and hereditary subset problems. J Graph Algorithms Appl 4(1):1\u201316","journal-title":"J Graph Algorithms Appl"},{"key":"9883_CR15","unstructured":"Hoos HH, Boutilier C (2000) Solving combinatorial auctions using stochastic local search. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp 22\u201329"},{"key":"9883_CR16","unstructured":"Lau HC, Goh YG (2002) An intelligent brokering system to support multi-agent 4th-party logistics. In: Proceedings of the 14th International Conference on Tools with Artificial Intelligence, pp 154\u2013161"},{"key":"9883_CR17","doi-asserted-by":"crossref","unstructured":"Leyton-Brown K, Pearson M, Shoham Y (2000) Towards a universal test suite for combinatorial auction algorithms. In: ACM Conference on Electronic Commerce, pp 66\u201376","DOI":"10.1145\/352871.352879"},{"key":"9883_CR18","unstructured":"Leyton-Brown K, Tennenholtz M, Shoham Y (2000) An algorithm for multi-unit combinatorial auctions. In: Proceedings of the 17th National Conference on Artificial Intelligence, Austin, Gemes-2000, Bilbao, and ISMP-2000, Atlanta, pp 56\u201361"},{"issue":"1","key":"9883_CR19","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10479-012-1133-2","volume":"196","author":"G Lin","year":"2012","unstructured":"Lin G, Zhu WX (2012) A discrete dynamic convexized method for the max-cut problem. Ann Oper Res 196(1):371\u2013390","journal-title":"Ann Oper Res"},{"issue":"1","key":"9883_CR20","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/j.ejor.2009.07.016","volume":"203","author":"Z L\u00fc","year":"2010","unstructured":"L\u00fc Z, Hao JK (2010) A memetic algorithm for graph coloring. Eur J Oper Res 203(1):241\u2013250","journal-title":"Eur J Oper Res"},{"issue":"5","key":"9883_CR21","doi-asserted-by":"crossref","first-page":"507","DOI":"10.1023\/B:HEUR.0000045322.51784.2a","volume":"10","author":"M Mito","year":"2004","unstructured":"Mito M, Fujita S (2004) On heuristics for solving winner determination problem in combinatorial auctions. J Heuristics 10(5):507\u2013523","journal-title":"J Heuristics"},{"issue":"2","key":"9883_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/MIS.2006.23","volume":"21","author":"T Mullen","year":"2006","unstructured":"Mullen T, Avasarala V, Hall DL (2006) Customer-driven sensor management. IEEE Intell Syst 21(2):41\u201349","journal-title":"IEEE Intell Syst"},{"issue":"8","key":"9883_CR23","doi-asserted-by":"crossref","first-page":"1131","DOI":"10.1287\/mnsc.44.8.1131","volume":"44","author":"MH Rothkopf","year":"1998","unstructured":"Rothkopf MH, Pekee A, Ronald M (1998) Computationally manageable combinatorial auctions. Manage Sci 44(8):1131\u20131147","journal-title":"Manage Sci"},{"issue":"1\u20132","key":"9883_CR24","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 (2002) Algorithms for optimal winner determination in combinatorial auctions. Artif Intell 135(1\u20132):1\u201354","journal-title":"Artif Intell"},{"key":"9883_CR25","unstructured":"Sandholm T, Suri S (2000) Improved optimal algorithm for combinatorial auctions and generalizations. In: Proceedings of the 17th National Conference on Artificial Intelligence, pp 90\u201397"},{"key":"9883_CR26","unstructured":"Sandholm T, Suri S, Gilpin A, Levine D (2001) CABoB: a fast optimal algorithm for combinatorial auctions. In: Proceedings of the International Joint Conference on Artificial Intelligence, pp 1102\u20131108"},{"key":"9883_CR27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/978-3-319-00651-2_5","volume":"489","author":"SK Shil","year":"2013","unstructured":"Shil SK, Mouhoub M, Sadaoui S (2013) Winner determination in combinatorial reverse auctions. Contemp Chall Solut Appl Artif Intell 489:35\u201340","journal-title":"Contemp Chall Solut Appl Artif Intell"},{"key":"9883_CR28","doi-asserted-by":"crossref","unstructured":"Walsh WE, Wellman M, Ygge F (2000) Combinatorial auctions for supply chain formation. In: ACM Conference on Electronic Commerce, pp 260\u2013269","DOI":"10.1145\/352871.352900"},{"issue":"10","key":"9883_CR29","doi-asserted-by":"crossref","first-page":"2723","DOI":"10.1016\/j.cor.2008.12.002","volume":"36","author":"WX Zhu","year":"2009","unstructured":"Zhu WX, Ali MM (2009) Discrete dynamic convexized method for nonlinearly constrained integer programming. Comput Oper Res 36(10):2723\u20132728","journal-title":"Comput Oper Res"},{"issue":"1","key":"9883_CR30","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1016\/j.cam.2008.01.023","volume":"223","author":"WX Zhu","year":"2009","unstructured":"Zhu WX, Fan H (2009) A discrete dynamic convexized method for nonlinear integer programming. J Comput Appl Math 223(1):356\u2013373","journal-title":"J Comput Appl Math"},{"issue":"12","key":"9883_CR31","doi-asserted-by":"crossref","first-page":"1792","DOI":"10.1016\/j.cor.2011.02.014","volume":"38","author":"WX Zhu","year":"2011","unstructured":"Zhu WX, Lin G (2011) A dynamic convexized method for nonconvex mixed integer nonlinear programming. Comput Oper Res 38(12):1792\u20131804","journal-title":"Comput Oper Res"},{"issue":"1","key":"9883_CR32","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/ijoc.1110.0492","volume":"25","author":"WX Zhu","year":"2013","unstructured":"Zhu WX, Lin G, Ali MM (2013) Max-k-cut by the discrete dynamic convexized method. INFORMS J Comput 25(1):27\u201340","journal-title":"INFORMS J Comput"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9883-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-015-9883-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-015-9883-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:26Z","timestamp":1559276606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-015-9883-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,4,28]]},"references-count":32,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2016,8]]}},"alternative-id":["9883"],"URL":"https:\/\/doi.org\/10.1007\/s10878-015-9883-9","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,4,28]]}}}