{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T10:17:27Z","timestamp":1773656247371,"version":"3.50.1"},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T00:00:00Z","timestamp":1129075200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Program."],"published-print":{"date-parts":[[2006,5]]},"DOI":"10.1007\/s10107-005-0641-0","type":"journal-article","created":{"date-parts":[[2005,10,12]],"date-time":"2005-10-12T11:10:17Z","timestamp":1129115417000},"page":"453-466","source":"Crossref","is-referenced-by-count":43,"title":["An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure"],"prefix":"10.1007","volume":"106","author":[{"given":"Sergei","family":"Chubanov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mikhail Y.","family":"Kovalyov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Erwin","family":"Pesch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,10,12]]},"reference":[{"key":"641_CR1","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/mnsc.31.5.634","volume":"5","author":"Ax\u00e4ter","year":"1985","unstructured":"Ax\u00e4ter, S.: Performance bounds for lot sizing heuristics. Management Sci. 5, 634\u2013640 (1985)","journal-title":"Management Sci."},{"key":"641_CR2","doi-asserted-by":"crossref","first-page":"1121","DOI":"10.1287\/mnsc.30.9.1121","volume":"9","author":"Bitran","year":"1984","unstructured":"Bitran, G.R., Magnanti, T.L., Yanasse, H.H.: Approximation methods for the uncapacitated dynamic lot size problem. Management Sci. 9, 1121\u20131140 (1984)","journal-title":"Management Sci."},{"key":"641_CR3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1287\/opre.34.1.63","volume":"34","author":"Bitran","year":"1986","unstructured":"Bitran, G.B., Matsuo, H.: Approxomation formulations for the single-product capacitated lot size problem. Oper. Res. 34, 63\u201374 (1986)","journal-title":"Oper. Res."},{"key":"641_CR4","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","volume":"28","author":"Bitran","year":"1982","unstructured":"Bitran, G.B., Yanasse, H.H.: Computational complexity of the capacitated lot size problem. Management Sci. 28, 1174\u20131186 (1982)","journal-title":"Management Sci."},{"key":"641_CR5","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","volume":"26","author":"Florian","year":"1980","unstructured":"Florian, M., Lenstra, J.K., Rinnooy Kan, A.H.G.: Deterministic production planning: algorithms and complexity. Management Sci. 26, 669\u2013679 (1980)","journal-title":"Management Sci."},{"key":"641_CR6","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0167-6377(95)91591-Z","volume":"17","author":"Kovalyov","year":"1995","unstructured":"Kovalyov, M.Y.: Improving the complexities of approximation algorithms for optimization problems. Oper. Res. Lett. 17, 85\u201387 (1995)","journal-title":"Oper. Res. Lett."},{"key":"641_CR7","unstructured":"Tanaev, V.S., Kovalyov, M.Y., Shafransky, Y.M.: Scheduling theory. Group technologies. Minsk, IEC NANB, (In Russian), 1998, pp. 41\u201344"},{"key":"641_CR8","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.26.2.339.10552","volume":"26","author":"Hoesel","year":"2001","unstructured":"Van Hoesel, C.P.M., Wagelmans, A.P.M.: 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":"641_CR9","first-page":"57","volume":"12","author":"Woeginger","year":"2000","unstructured":"Woeginger, G.J.: When does a dynamic programming formulation guarantee the existence of an FPTAS? J. Comput. 12, 57\u201374 (2000)","journal-title":"Comput."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0641-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-005-0641-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-005-0641-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T05:49:59Z","timestamp":1559108999000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-005-0641-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10,12]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,5]]}},"alternative-id":["641"],"URL":"https:\/\/doi.org\/10.1007\/s10107-005-0641-0","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10,12]]}}}