{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T22:57:59Z","timestamp":1648940279433},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T00:00:00Z","timestamp":1351641600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Sci. China Inf. Sci."],"published-print":{"date-parts":[[2014,1]]},"DOI":"10.1007\/s11432-012-4694-4","type":"journal-article","created":{"date-parts":[[2012,10,20]],"date-time":"2012-10-20T02:35:07Z","timestamp":1350700507000},"page":"1-9","source":"Crossref","is-referenced-by-count":0,"title":["A cost-sharing method for the multi-level economic lot-sizing game"],"prefix":"10.1007","volume":"57","author":[{"given":"GaiDi","family":"Li","sequence":"first","affiliation":[]},{"given":"DongLei","family":"Du","sequence":"additional","affiliation":[]},{"given":"DaChuan","family":"Xu","sequence":"additional","affiliation":[]},{"given":"RuYao","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,31]]},"reference":[{"key":"4694_CR1","doi-asserted-by":"crossref","first-page":"985","DOI":"10.1016\/j.cor.2003.09.009","volume":"32","author":"J Jeunet","year":"2005","unstructured":"Jeunet J, Jonard N. Single-point stochastic search algorithms for the multi-level lot-sizing problem. Comput Oper Res, 2005, 32: 985\u20131006","journal-title":"Comput Oper Res"},{"key":"4694_CR2","first-page":"69","volume-title":"Multi-Level Production Inventory Control Systems","author":"M Lambrecht","year":"1981","unstructured":"Lambrecht M, Vander Eecken J, Vanderveken H. Review of optimal and heuristic methods for a class of facilities in series dynamic lot-size problems. In: Schwarz L B, ed. Multi-Level Production Inventory Control Systems. Amsterdam: North-Holland Publishing Company, 1981. 69\u201394"},{"key":"4694_CR3","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1287\/mnsc.15.9.506","volume":"15","author":"W I Zangwill","year":"1969","unstructured":"Zangwill W I. A backlogging model and a multi-echelon model of a dynamic economic lot size production system-a network approach. Manage Sci, 1969, 15: 506\u2013527","journal-title":"Manage Sci"},{"key":"4694_CR4","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/PL00004200","volume":"18","author":"H Moulin","year":"2001","unstructured":"Moulin H, Shenker S. Strategyproof sharing of submodular cost: budget balance versus efficiency. J Econ Theor, 2001, 18: 511\u2013533","journal-title":"J Econ Theor"},{"key":"4694_CR5","first-page":"584","volume-title":"Proceedings of FOCS","author":"M P\u00e1l","year":"2003","unstructured":"P\u00e1l M, Tardos \u00c9. Group strategyproof mechanisms via primal-dual algorithms. In: Proceedings of FOCS. Cambridge: IEEE Conference Publications, 2003. 584\u2013593"},{"key":"4694_CR6","first-page":"1117","volume":"176","author":"W Heuvel van den","year":"2005","unstructured":"van den Heuvel W, Borm P, Hamers H. Economic lot-sizing games. Eur J Oper Res, 2005, 176: 1117\u20131130","journal-title":"Eur J Oper Res"},{"key":"4694_CR7","series-title":"NYU Working Paper","volume-title":"Working Paper","author":"X Chen","year":"2009","unstructured":"Chen X, Zhang J. Duality approaches to economic lot-sizing games. Working Paper. New York: Stern School of Business, New York University, 2009. NYU Working Paper No. OM-2006-01"},{"key":"4694_CR8","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/BF01580738","volume":"40","author":"Y Pochet","year":"1988","unstructured":"Pochet Y, Wolsey L A. Lot-size models with backlogging: strong reformulations and cutting planes. Math Program, 1988, 40: 317\u2013335","journal-title":"Math Program"},{"key":"4694_CR9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/j.orl.2008.11.001","volume":"37","author":"D Xu","year":"2009","unstructured":"Xu D, Yang R. A cost-sharing method for an economic lot-sizing game. Oper Res Lett, 2009, 37: 107\u2013110","journal-title":"Oper Res Lett"},{"key":"4694_CR10","first-page":"166","volume-title":"Proceedings of COCOA","author":"R Yang","year":"2009","unstructured":"Yang R, Wang Z, Xu D. A cost-sharing method for the soft-capacitated economic lot-sizing game. In: Du D, Hu X, Pardols P, eds. Proceedings of COCOA. Berlin\/Heidelberg: Springer-Verlag, 2009. 166\u2013173"},{"key":"4694_CR11","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/S0020-0190(99)00144-1","volume":"72","author":"K I Aardal","year":"1999","unstructured":"Aardal K I, Chudak F A, Shmoys D B. A 3-approximation algorithm for the k-level uncapacitated facility location problem. Inform Process Lett, 1999, 72: 161\u2013167","journal-title":"Inform Process Lett"},{"key":"4694_CR12","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1007\/s10107-006-0704-x","volume":"108","author":"J Zhang","year":"2006","unstructured":"Zhang J. Approximating the two-level facility location problem via a quasi-greedy approach. Math Program, 2006, 108: 159\u2013176","journal-title":"Math Program"},{"key":"4694_CR13","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/S0895480102417215","volume":"18","author":"A Ageev","year":"2005","unstructured":"Ageev A, Ye Y, Zhang J. Improved combinatorial approximation algorithms for the k-level facility location problem. SIAM J Discrete Math, 2005, 18: 207\u2013217","journal-title":"SIAM J Discrete Math"},{"key":"4694_CR14","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1016\/j.orl.2005.06.002","volume":"34","author":"D Xu","year":"2006","unstructured":"Xu D, Du D. The k-level facility location game. Oper Res Lett, 2006, 34: 421\u2013426","journal-title":"Oper Res Lett"},{"key":"4694_CR15","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/s00453-007-9032-7","volume":"53","author":"X Chen","year":"2009","unstructured":"Chen X, Chen B. Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica, 2009, 53: 263\u2013297","journal-title":"Algorithmica"},{"key":"4694_CR16","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1007\/s00453-011-9526-1","volume":"63","author":"D Du","year":"2012","unstructured":"Du D, Lu R, Xu D. A primal-dual approximation algorithm for the facility location problem with submodular penalties. Algorithmica, 2012, 63: 191\u2013200","journal-title":"Algorithmica"},{"key":"4694_CR17","first-page":"77","volume-title":"Proceedings of ICALP, Part II","author":"S Li","year":"2011","unstructured":"Li S. A 1.488-approximation algorithm for the uncapacitated facility location problem. In: Aceto L, Henzinger M, Sgall J, eds. Proceedings of ICALP, Part II. Berlin\/Heidelberg: Springer-Verlag, 2011. 77\u201388"},{"key":"4694_CR18","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1137\/S0097539703435716","volume":"36","author":"M Mahdian","year":"2006","unstructured":"Mahdian M, Ye Y, Zhang J. Improved approximation algorithms for metric facility location problems. SIAM J Comput, 2006, 36: 411\u2013432","journal-title":"SIAM J Comput"},{"key":"4694_CR19","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1287\/trsc.1090.0302","volume":"44","author":"J Shu","year":"2010","unstructured":"Shu J. An efficient greedy heuristic for warehouse-retailer network design optimization. Transport Sci, 2010, 44: 183\u2013192","journal-title":"Transport Sci"},{"key":"4694_CR20","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1287\/opre.1040.0140","volume":"53","author":"J Shu","year":"2005","unstructured":"Shu J, Teo C P, Max S Z J. Stochastic transportation-inventory network design problem. Oper Res, 2005, 53: 48\u201360","journal-title":"Oper Res"},{"key":"4694_CR21","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/moor.1040.0125","volume":"30","author":"J Zhang","year":"2005","unstructured":"Zhang J, Chen B, Ye Y. A multiexchange local search algorithm for the capacitated facility location problem. Math Oper Res, 2005, 30: 389\u2013403","journal-title":"Math Oper Res"},{"key":"4694_CR22","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/j.tcs.2007.05.024","volume":"384","author":"P Zhang","year":"2007","unstructured":"Zhang P. A new approximation algorithm for the k-facility location problem. Theor Comput Sci, 2007, 384: 126\u2013135","journal-title":"Theor Comput Sci"},{"key":"4694_CR23","doi-asserted-by":"crossref","first-page":"2332","DOI":"10.1007\/s11432-010-4092-8","volume":"53","author":"K Lu","year":"2010","unstructured":"Lu K, Chen G, Feng Y, et al. Approximation algorithm for minimizing relay node placement in wireless sensor networks. Sci China Inf Sci, 2010, 53: 2332\u20132342","journal-title":"Sci China Inf Sci"},{"key":"4694_CR24","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/s11432-010-4131-5","volume":"54","author":"H Jiang","year":"2011","unstructured":"Jiang H, Zhu D. A 14\/11-approximation algorithm for sorting by short block-move. Sci China Inf Sci, 2011, 54: 279\u2013292","journal-title":"Sci China Inf Sci"},{"key":"4694_CR25","first-page":"100","volume-title":"Operations Research and its Applications, ISORA","author":"G Li","year":"2011","unstructured":"Li G, Du D, Xu D, et al. The multi-level economic lot-sizing game. In: Zhang X, ed. Operations Research and its Applications, ISORA. 2011. 100\u2013106"}],"container-title":["Science China Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-012-4694-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11432-012-4694-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11432-012-4694-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:37:48Z","timestamp":1559389068000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11432-012-4694-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,31]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"alternative-id":["4694"],"URL":"https:\/\/doi.org\/10.1007\/s11432-012-4694-4","relation":{},"ISSN":["1674-733X","1869-1919"],"issn-type":[{"value":"1674-733X","type":"print"},{"value":"1869-1919","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,31]]}}}