{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T10:06:05Z","timestamp":1725876365332},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319514680"},{"type":"electronic","value":"9783319514697"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-51469-7_11","type":"book-chapter","created":{"date-parts":[[2016,12,24]],"date-time":"2016-12-24T21:23:01Z","timestamp":1482614581000},"page":"132-143","source":"Crossref","is-referenced-by-count":4,"title":["Economic Lot-Sizing Problem with Remanufacturing Option: Complexity and Algorithms"],"prefix":"10.1007","author":[{"given":"Kerem","family":"Akartunal\u0131","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashwin","family":"Arulselvan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,12,25]]},"reference":[{"issue":"3","key":"11_CR1","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10589-012-9465-z","volume":"53","author":"K Akartunal\u0131","year":"2012","unstructured":"Akartunal\u0131, K., Miller, A.: A computational analysis of lower bounds for big bucket production planning problems. Comput. Optim. Appl. 53(3), 729\u2013753 (2012)","journal-title":"Comput. Optim. Appl."},{"key":"11_CR2","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk, A., Mu\u00f1oz, J.C.: A study of the lot-sizing polytope. Math. Program. 99, 443\u2013465 (2004)","journal-title":"Math. Program."},{"issue":"2","key":"11_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1007\/s10107-014-0803-z","volume":"153","author":"T Carnes","year":"2015","unstructured":"Carnes, T., Shmoys, D.: Primal-dual schema for capacitated covering problems. Math. Program. 153(2), 289\u2013308 (2015)","journal-title":"Math. Program."},{"issue":"4","key":"11_CR4","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"R Erickson","year":"1987","unstructured":"Erickson, R., Monma, C., Veinott, J.A.F.: Send-and-split method for minimum-concave-cost network flows. Math. Oper. Res. 12(4), 634\u2013664 (1987)","journal-title":"Math. Oper. Res."},{"key":"11_CR5","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/mnsc.18.1.12","volume":"18","author":"M Florian","year":"1971","unstructured":"Florian, M., Klein, M.: Deterministic production planning with concave costs and capacity constraints. Manage. Sci. 18, 12\u201320 (1971)","journal-title":"Manage. Sci."},{"issue":"7","key":"11_CR6","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","volume":"26","author":"M Florian","year":"1980","unstructured":"Florian, M., Lenstra, J., Rinnooy Kan, H.: Deterministic production planning: algorithms and complexity. Manag. Sci. 26(7), 669\u2013679 (1980)","journal-title":"Manag. Sci."},{"key":"11_CR7","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M Garey","year":"1979","unstructured":"Garey, M., Johnson, D.: Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman & Co., New York (1979)"},{"issue":"11","key":"11_CR8","doi-asserted-by":"crossref","first-page":"995","DOI":"10.1080\/07408170108936890","volume":"33","author":"B Golany","year":"2001","unstructured":"Golany, B., Yang, J., Yu, G.: Economic lot-sizing with remanufacturing options. IIE Trans. 33(11), 995\u20131003 (2001)","journal-title":"IIE Trans."},{"key":"11_CR9","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.26.2.339.10552","volume":"26","author":"CV Hoesel","year":"2001","unstructured":"Hoesel, C.V., Wagelmans, A.: Fully polynomial approximation schemes for single-item capacitated economic lot-sizing problems. Math. Oper. Res. 26, 339\u2013357 (2001)","journal-title":"Math. Oper. Res."},{"key":"11_CR10","first-page":"415","volume-title":"Nonlinear Programming","author":"B Korte","year":"1981","unstructured":"Korte, B., Schrader, R.: On the existence of fast approximation schemes. In: Magasarian, S.R.O., Meyer, R. (eds.) Nonlinear Programming, vol. 4, pp. 415\u2013437. Academic Press, New York (1981)"},{"key":"11_CR11","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G Nemhauser","year":"1988","unstructured":"Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley-Interscience, New York (1988)"},{"issue":"4","key":"11_CR12","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","volume":"33","author":"M Padberg","year":"1985","unstructured":"Padberg, M., van Roy, T., Wolsey, L.: Valid linear inequalities for fixed charge problems. Oper. Res. 33(4), 842\u2013861 (1985)","journal-title":"Oper. Res."},{"issue":"1","key":"11_CR13","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0377-2217(93)90263-M","volume":"71","author":"R Rardin","year":"1993","unstructured":"Rardin, R., Wolsey, L.: Valid inequalities and projecting the multicommodity extended formulation for uncapacitated fixed charge network flow problems. Eur. J. Oper. Res. 71(1), 95\u2013109 (1993)","journal-title":"Eur. J. Oper. Res."},{"issue":"20","key":"11_CR14","doi-asserted-by":"crossref","first-page":"4377","DOI":"10.1080\/00207540600693564","volume":"44","author":"R Teunter","year":"2006","unstructured":"Teunter, R., Bay\u0131nd\u0131r, Z., van den Heuvel, W.: Dynamic lot sizing with product returns and remanufacturing. Int. J. Prod. Res. 44(20), 4377\u20134400 (2006)","journal-title":"Int. J. Prod. Res."},{"key":"11_CR15","unstructured":"van den Heuvel, W.: On the complexity of the economic lot-sizing problem with remanufacturing options. Econometric Institute Research Papers EI 2004-46, Erasmus University Rotterdam, Erasmus School of Economics (ESE), Econometric Institute (2004)"},{"key":"11_CR16","volume-title":"Approximation Algorithms","author":"V Vazirani","year":"2001","unstructured":"Vazirani, V.: Approximation Algorithms. Springer-Verlag New York, Inc., New York (2001)"},{"key":"11_CR17","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H Wagner","year":"1958","unstructured":"Wagner, H., Whitin, T.: Dynamic version of the economic lot size model. Manage. Sci. 5, 89\u201396 (1958)","journal-title":"Manage. Sci."}],"container-title":["Lecture Notes in Computer Science","Machine Learning, Optimization, and Big Data"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-51469-7_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,28]],"date-time":"2020-09-28T06:32:09Z","timestamp":1601274729000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-51469-7_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319514680","9783319514697"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-51469-7_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}