{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,12]],"date-time":"2026-07-12T02:55:40Z","timestamp":1783824940286,"version":"3.55.0"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,7,15]],"date-time":"2008-07-15T00:00:00Z","timestamp":1216080000000},"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":[[2010,1]]},"DOI":"10.1007\/s10107-008-0228-7","type":"journal-article","created":{"date-parts":[[2008,7,14]],"date-time":"2008-07-14T14:46:35Z","timestamp":1216046795000},"page":"123-143","source":"Crossref","is-referenced-by-count":12,"title":["Single item lot-sizing with non-decreasing capacities"],"prefix":"10.1007","volume":"121","author":[{"given":"Yves","family":"Pochet","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2008,7,15]]},"reference":[{"key":"228_CR1","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., Munoz J.: A study of the lot-sizing polytope. Math. Program. 99, 443\u2013466 (2004)","journal-title":"Math. Program."},{"key":"228_CR2","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","volume":"28","author":"G. Bitran","year":"1982","unstructured":"Bitran G., Yanasse H.: Computational complexity of the capacitated lot size problem. Manage. Sci. 28, 1174\u20131186 (1982)","journal-title":"Manage. Sci."},{"key":"228_CR3","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1287\/mnsc.34.3.420","volume":"34","author":"C. Chung","year":"1988","unstructured":"Chung C., Lin M.: An O(T 2) algorithm for the NI\/G\/NI\/ND capacitated single item lot size problem. Manage. Sci. 34, 420\u2013426 (1988)","journal-title":"Manage. Sci."},{"key":"228_CR4","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/05064148X","volume":"29","author":"M. Conforti","year":"2007","unstructured":"Conforti M., Di Summa M., Wolsey L.: The mixing set with flows. SIAM J. Discrete Math. 29, 396\u2013407 (2007)","journal-title":"SIAM J. Discrete Math."},{"key":"228_CR5","doi-asserted-by":"crossref","unstructured":"Conforti, M., Wolsey, L.: Compact formulations as a union of polyhedra. Math. Program. 114, 277\u2013289 (2008). doi: 10.1007\/s10107-007-0101-0 (2007)","DOI":"10.1007\/s10107-007-0101-0"},{"key":"228_CR6","doi-asserted-by":"crossref","unstructured":"de Farias Jr., I., Zhao, M.: The mixing-mir set with divisible capacities. Math. Program. 115, 73\u2013103 (2008). doi: 10.1007\/s10107-007-0140-6 (2007)","DOI":"10.1007\/s10107-007-0140-6"},{"key":"228_CR7","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/j.orl.2007.04.007","volume":"36","author":"M. Di Summa","year":"2007","unstructured":"Di Summa M., Wolsey L.: Lot-sizing on a tree. Oper. Res. Lett. 36, 7\u201313 (2007)","journal-title":"Oper. Res. Lett."},{"key":"228_CR8","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."},{"key":"228_CR9","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.K., Rinnooy Kan H.G.: Deterministic production planning: algorithms and complexity. Manage. Sci. 26, 669\u2013679 (1980)","journal-title":"Manage. Sci."},{"key":"228_CR10","doi-asserted-by":"crossref","first-page":"142","DOI":"10.1287\/mnsc.42.1.142","volume":"42","author":"C. Hoesel van","year":"1996","unstructured":"van Hoesel C., Wagelmans A.: An O(T 3) algorithm for the economic lot-sizing problem with constant capacities. Manage. Sci. 42, 142\u2013150 (1996)","journal-title":"Manage. Sci."},{"key":"228_CR11","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/s10107-003-0397-3","volume":"98","author":"A. Miller","year":"2003","unstructured":"Miller A., Wolsey L.: Tight formulations for some simple MIPs and convex objective IPs. Math. Program. B 98, 73\u201388 (2003)","journal-title":"Math. Program. B"},{"key":"228_CR12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0167-6377(88)90076-4","volume":"7","author":"Y. Pochet","year":"1988","unstructured":"Pochet Y.: Valid inequalities and separation for capacitated economic lot-sizing. Oper. Res. Lett. 7, 109\u2013116 (1988)","journal-title":"Oper. Res. Lett."},{"key":"228_CR13","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","volume":"18","author":"Y. Pochet","year":"1993","unstructured":"Pochet Y., Wolsey L.: Lot-sizing with constant batches: formulation and valid inequalities. Math. Oper. Res. 18, 767\u2013785 (1993)","journal-title":"Math. Oper. Res."},{"key":"228_CR14","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01582225","volume":"67","author":"Y. Pochet","year":"1994","unstructured":"Pochet Y., Wolsey L.: Polyhedra for lot-sizing with Wagner\u2013Whitin costs. Math. Program. 67, 297\u2013324 (1994)","journal-title":"Math. Program."},{"key":"228_CR15","volume-title":"Production Planning by Mixed Integer Programming","author":"Y. Pochet","year":"2006","unstructured":"Pochet Y., Wolsey L.: Production Planning by Mixed Integer Programming. Springer Series in Operations Research and Financial Engineering, New York (2006)"},{"key":"228_CR16","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1287\/moor.1070.0257","volume":"32","author":"M. Vyve Van","year":"2007","unstructured":"Van Vyve M.: Algorithms for single-item lot-sizing problems with constant batch size. Math. Oper. Res. 32, 594\u2013613 (2007)","journal-title":"Math. Oper. Res."},{"key":"228_CR17","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1287\/moor.1040.0130","volume":"30","author":"M. Vyve Van","year":"2005","unstructured":"Van Vyve M.: The continuous mixing polyhedron. Math. Oper. Res. 30, 441\u2013452 (2005)","journal-title":"Math. Oper. Res."},{"key":"228_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10107-004-0521-z","volume":"108","author":"M. Vyve Van","year":"2006","unstructured":"Van Vyve M.: Linear programming extended formulations for the single-item lot-sizing problem with backlogging and constant capacity. Math. Program. 108, 53\u201378 (2006)","journal-title":"Math. Program."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0228-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10107-008-0228-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10107-008-0228-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:50:05Z","timestamp":1559123405000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10107-008-0228-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,7,15]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["228"],"URL":"https:\/\/doi.org\/10.1007\/s10107-008-0228-7","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,7,15]]}}}