{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T22:36:55Z","timestamp":1768775815103,"version":"3.49.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1023\/a:1018963805173","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T22:07:13Z","timestamp":1045692433000},"page":"75-95","source":"Crossref","is-referenced-by-count":9,"title":["A polyhedral approach to a production planning problem"],"prefix":"10.1007","volume":"96","author":[{"given":"Miguel","family":"Constantino","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"326100_CR1","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1287\/opre.41.3.549","volume":"41","author":"A. Aggarwal","year":"1993","unstructured":"A. Aggarwal and J. Park, Improved algorithms for economic lot size problems, Operations Research 41 (1993) 549\u2013571.","journal-title":"Operations Research"},{"key":"326100_CR2","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","volume":"30","author":"I. Barany","year":"1984","unstructured":"I. Barany, T.J. Van Roy and L.A. Wolsey, Strong formulations for multi-item capacitated lot sizing, Management Science 30 (1984) 1255\u20131261.","journal-title":"Management Science"},{"key":"326100_CR3","first-page":"32","volume":"22","author":"I. Barany","year":"1984","unstructured":"I. Barany, T.J. Van Roy and L.A. Wolsey, Uncapacitated lot sizing: the convex hull of solutions, Mathematical Programming Study 22 (1984) 32\u201343.","journal-title":"Uncapacitated lot sizing: the convex hull of solutions, Mathematical"},{"key":"326100_CR4","unstructured":"M. Constantino, A polyhedral approach to production planning models: start-up costs and times, upper and lower bounds on production, Ph.D. Dissertation, Universit\u00b4e Catholique de Louvain, Belgium (1995)."},{"key":"326100_CR5","volume-title":"Working Paper","author":"M. Constantino","year":"1996","unstructured":"M. Constantino, Valid inequalities for lot-sizing with start-up costs and times, upper and lower bounds on production, Working Paper, Centro de Investigaca\u00b8\u00e3 Operacional, University of Lisbon, Portugal (1996)."},{"key":"326100_CR6","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1016\/S0025-5610(96)00021-4","volume":"75","author":"M. Constantino","year":"1996","unstructured":"M. Constantino, A cutting plane approach to capacitated lot-sizing with start-up costs, Mathematical Programming 75 (1996) 353\u2013376.","journal-title":"Mathematical Programming"},{"key":"326100_CR7","volume-title":"Using the CPLEX Callable Library and CPLEX Mixed Integer Library","author":"CPLEX Optimization, Inc.","year":"1994","unstructured":"CPLEX Optimization, Inc., Using the CPLEX Callable Library and CPLEX Mixed Integer Library (Incline Village, NV, USA, 1994)."},{"key":"326100_CR8","volume-title":"Ph.D.Dissertation","author":"C.A. van Eijl","year":"1996","unstructured":"C.A. van Eijl, A polyhedral approach to the discrete lot-sizing and scheduling problem, Ph.D.Dissertation, Technische Universiteit Eindhoven, The Netherlands (1996)."},{"key":"326100_CR9","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/mnsc.37.8.909","volume":"37","author":"A. Federgruen","year":"1991","unstructured":"A. Federgruen and M. Tzur, A simple forward algorithm to solve general dynamic lot sizing models with n periods in O(nlog n) or O(n) time, Management Science 37 (1991) 909\u2013925.","journal-title":"Management Science"},{"key":"326100_CR10","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/0377-2217(94)90079-5","volume":"75","author":"C.P.M. van Hoesel","year":"1994","unstructured":"C.P.M. van Hoesel and A.W.J. Kolen, A Linear description of the discrete lot-sizing and scheduling problem, European Journal of Operational Research 75 (1994) 342\u2013353.","journal-title":"European Journal of Operational Research"},{"key":"326100_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1137\/S0895480191196289","volume":"7","author":"C.P.M. van Hoesel","year":"1994","unstructured":"C.P.M. van Hoesel, A.P.M. Wagelmans and L.A. Wolsey, Polyhedral characterization of the economic lot-sizing problem with start-up costs, SIAM Journal of Discrete Mathematics 7 (1994) 141\u2013151.","journal-title":"SIAM Journal of Discrete Mathematics"},{"key":"326100_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF01589110","volume":"45","author":"J. Leung","year":"1989","unstructured":"J. Leung, T.M. Magnanti and R. Vachani, Facets and algorithms for capacitated lot-sizing, Mathematical Programming 45 (1989) 331\u2013359.","journal-title":"Mathematical Programming"},{"key":"326100_CR13","doi-asserted-by":"crossref","first-page":"456","DOI":"10.1287\/opre.38.3.456","volume":"38","author":"T.M. Magnanti","year":"1990","unstructured":"T.M. Magnanti and R. Vachani, A strong cutting plane algorithm for production scheduling with changeover costs, Operations Research 38 (1990) 456\u2013473.","journal-title":"Operations Research"},{"key":"326100_CR14","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"G.L. Nemhauser and M.W.P. Savelsbergh, MINTO, a Mixed INTeger Optimizer, Operations Research Letters 15 (1994) 47\u201358.","journal-title":"Operations Research Letters"},{"key":"326100_CR15","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"M.W. Padberg","year":"1991","unstructured":"M.W. Padberg and G. Rinaldi, A branch and cut algorithm for the resolution of large-scale symmetric traveling salesman problems, SIAM Review 33 (1991) 60\u2013100.","journal-title":"SIAM Review"},{"key":"326100_CR16","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0167-6377(88)90076-4","volume":"7","author":"Y. Pochet","year":"1988","unstructured":"Y. Pochet, Valid inequalities and separation for capacitated economic lot-sizing, Operations Research Letters 7 (1988) 109\u2013116.","journal-title":"Operations Research Letters"},{"key":"326100_CR17","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1007\/BF01580738","volume":"40","author":"Y. Pochet","year":"1988","unstructured":"Y. Pochet and L.A. Wolsey, Lot-size models with backlogging: strong reformulation and cutting planes, Mathematical Programming 40 (1988) 317\u2013335.","journal-title":"Mathematical Programming"},{"key":"326100_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/mnsc.37.1.53","volume":"37","author":"Y. Pochet","year":"1991","unstructured":"Y. Pochet and L.A. Wolsey, Solving multi-item lot-sizing problems using strong cutting planes, Management Science 37 (1991) 53\u201367.","journal-title":"Management Science"},{"key":"326100_CR19","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","volume":"18","author":"Y. Pochet","year":"1993","unstructured":"Y. Pochet and L.A. Wolsey, Lot-sizing with constant batches: formulation and valid inequalities, Mathematics of Operations Research 18 (1993) 767\u2013785.","journal-title":"Mathematics of Operations Research"},{"key":"326100_CR20","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/BF01582225","volume":"67","author":"Y. Pochet","year":"1994","unstructured":"Y. Pochet and L.A. Wolsey, Polyhedra for lot-sizing with Wagner-Whitin costs, Mathematical Programming 67 (1994) 297\u2013323.","journal-title":"Mathematical Programming"},{"key":"326100_CR21","doi-asserted-by":"crossref","unstructured":"Y. Pochet and L.A. Wolsey, Algorithms and reformulations for lot sizing problems, in: Combinatorial Optimization, eds. W. Cook et al., DIMACS Series in Discrete Mathematics and Theoretical Computer Science 20 (1995) 245\u2013293.","DOI":"10.1090\/dimacs\/020\/05"},{"key":"326100_CR22","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1287\/opre.40.1.S145","volume":"40","author":"A.P.M. Wagelmans","year":"1992","unstructured":"A.P.M. Wagelmans, C.P.M. van Hoesel and A.W.J. Kolen, Economic lot-sizing: an O(n log n) algorithm that runs in linear time in the Wagner-Whitin case, Operations Research 40 (1992) 145\u2013156.","journal-title":"Operations Research"},{"key":"326100_CR23","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"H.M. Wagner","year":"1958","unstructured":"H.M. Wagner and T.M. Whitin, Dynamic version of the economic lot size model, Management Science 5 (1958) 89\u201396.","journal-title":"Management Science"},{"key":"326100_CR24","first-page":"767","volume":"18","author":"L.A. Wolsey","year":"1989","unstructured":"L.A. Wolsey, Uncapacitated lot-sizing problems with start-up costs, Mathematics of Operations Research 18 (1989) 767\u2013785.","journal-title":"Mathematics of Operations Research"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018963805173.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1018963805173\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1018963805173.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T05:56:11Z","timestamp":1747547771000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1018963805173"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":24,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["326100"],"URL":"https:\/\/doi.org\/10.1023\/a:1018963805173","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}