{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T05:45:14Z","timestamp":1740116714381,"version":"3.37.3"},"reference-count":37,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,12,20]],"date-time":"2018-12-20T00:00:00Z","timestamp":1545264000000},"content-version":"am","delay-in-days":294,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,3,1]],"date-time":"2018-03-01T00:00:00Z","timestamp":1519862400000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMMI-1100765"],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"name":"CAREER","award":["CBET-1554018"]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1016\/j.cor.2017.11.006","type":"journal-article","created":{"date-parts":[[2017,11,13]],"date-time":"2017-11-13T19:30:15Z","timestamp":1510601415000},"page":"132-144","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":8,"special_numbering":"C","title":["Partial objective inequalities for the multi-item capacitated lot-sizing problem"],"prefix":"10.1016","volume":"91","author":[{"given":"\u0130. Esra","family":"B\u00fcy\u00fcktahtak\u0131n","sequence":"first","affiliation":[]},{"given":"J. Cole","family":"Smith","sequence":"additional","affiliation":[]},{"given":"Joseph C.","family":"Hartman","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"4","key":"10.1016\/j.cor.2017.11.006_bib0001","doi-asserted-by":"crossref","first-page":"766","DOI":"10.1287\/ijoc.2016.0712","article-title":"Local cuts and two-period convex hull closures for big-bucket lot-sizing problems","volume":"28","author":"Akartunal\u0131","year":"2016","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"10.1016\/j.cor.2017.11.006_bib0002","doi-asserted-by":"crossref","first-page":"729","DOI":"10.1007\/s10589-012-9465-z","article-title":"A computational analysis of lower bounds for big bucket production planning problems","volume":"53","author":"Akartunal\u0131","year":"2012","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/j.cor.2017.11.006_bib0003","doi-asserted-by":"crossref","first-page":"412","DOI":"10.1016\/j.ejor.2008.08.026","article-title":"Valid inequalities for the single-item capacitated lot sizing problem with step-wise costs","volume":"198","author":"Akbal\u0131k","year":"2009","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"10.1016\/j.cor.2017.11.006_bib0004","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10107-007-0202-9","article-title":"Multi-item lot-sizing with joint set-up costs","volume":"119","author":"Anily","year":"2009","journal-title":"Math. Program."},{"issue":"3","key":"10.1016\/j.cor.2017.11.006_bib0005","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","article-title":"A study of the lot-sizing polytope","volume":"99","author":"Atamt\u00fcrk","year":"2004","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2017.11.006_bib0006","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1007\/BF01580440","article-title":"Facets of the knapsack polytope","volume":"8","author":"Balas","year":"1975","journal-title":"Math. Program."},{"issue":"10","key":"10.1016\/j.cor.2017.11.006_bib0007","doi-asserted-by":"crossref","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","article-title":"Strong formulations for multi-item capacitated lot sizing","volume":"30","author":"Barany","year":"1984","journal-title":"Manage. Sci."},{"key":"10.1016\/j.cor.2017.11.006_bib0008","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/BFb0121006","article-title":"Uncapacitated lot sizing: the convex hull of solutions","volume":"22","author":"Barany","year":"1984","journal-title":"Math. Program. Study"},{"issue":"5","key":"10.1016\/j.cor.2017.11.006_bib0009","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/mnsc.46.5.724.12048","article-title":"bc\u2013prod: A specialized branch-and-cut system for lot-sizing problems","volume":"46","author":"Belvaux","year":"2000","journal-title":"Manage. Sci."},{"issue":"7","key":"10.1016\/j.cor.2017.11.006_bib0010","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1287\/mnsc.47.7.993.9800","article-title":"Modelling practical lot-sizing problems as mixed integer programs","volume":"47","author":"Belvaux","year":"2001","journal-title":"Manage. Sci."},{"key":"10.1016\/j.cor.2017.11.006_bib0011","series-title":"Wiley Encyclopedia of Operations Research and Management Science","article-title":"Dynamic programming via linear programming","author":"B\u00fcy\u00fcktahtak\u0131n","year":"2011"},{"issue":"2","key":"10.1016\/j.cor.2017.11.006_bib0012","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s10898-015-0349-5","article-title":"Dynamic programming approximation algorithms for the capacitated lot-sizing problem","volume":"65","author":"B\u00fcy\u00fcktahtak\u0131n","year":"2016","journal-title":"J. Global Optim."},{"issue":"1","key":"10.1016\/j.cor.2017.11.006_bib0013","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/321556.321564","article-title":"An algorithm for convex polytopes","volume":"17","author":"Chand","year":"1970","journal-title":"J. ACM"},{"key":"10.1016\/j.cor.2017.11.006_bib0014","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02592189","article-title":"A cutting plane approach to capacitated lot-sizing with start-up costs","volume":"75","author":"Constantino","year":"1996","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2017.11.006_bib0015","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1023\/A:1018963805173","article-title":"A polyhedral approach to a production planning problem","volume":"96","author":"Constantino","year":"2000","journal-title":"Ann. Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2017.11.006_bib0016","doi-asserted-by":"crossref","first-page":"492","DOI":"10.1287\/mnsc.13.7.492","article-title":"On nonlinear fractional programming","volume":"13","author":"Dinkelbach","year":"1967","journal-title":"Manage. Sci."},{"key":"10.1016\/j.cor.2017.11.006_bib0017","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10107-003-0401-y","article-title":"Facets of the independent set polytope","volume":"98","author":"Easton","year":"2003","journal-title":"Math. Program."},{"issue":"6","key":"10.1016\/j.cor.2017.11.006_bib0018","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","article-title":"Solving multi-item capacitated lot sizing problems using variable redefinition","volume":"35","author":"Eppen","year":"1987","journal-title":"Oper. Res."},{"issue":"7","key":"10.1016\/j.cor.2017.11.006_bib0019","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","article-title":"Deterministic production planning: algorithms and complexity","volume":"26","author":"Florian","year":"1980","journal-title":"Manage. Sci."},{"issue":"3","key":"10.1016\/j.cor.2017.11.006_bib0020","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1287\/ijoc.2016.0691","article-title":"A horizon decomposition approach for the capacitated lot-sizing problem with setup times","volume":"28","author":"Fragkos","year":"2016","journal-title":"INFORMS J. Comput."},{"issue":"12","key":"10.1016\/j.cor.2017.11.006_bib0021","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1080\/0740817X.2010.504683","article-title":"Dynamic-programming-based inequalities for the capacitated lot-sizing problem","volume":"42","author":"Hartman","year":"2010","journal-title":"IIE Trans."},{"key":"10.1016\/j.cor.2017.11.006_bib0022","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF02591871","article-title":"Parametric approaches to fractional programs","volume":"26","author":"Ibaraki","year":"1983","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2017.11.006_bib0023","series-title":"INFORMS TutORials in Operations Research","first-page":"90","article-title":"Mixed-integer optimization approaches for deterministic and stochastic inventory management","volume":"8","author":"K\u00fc\u00e7\u00fckyavuz","year":"2011"},{"issue":"2","key":"10.1016\/j.cor.2017.11.006_bib0024","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/BF01589110","article-title":"Facets and algorithms for capacitated lot sizing","volume":"45","author":"Leung","year":"1989","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2017.11.006_bib0025","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1007\/s10107-002-0341-y","article-title":"Dynamic knapsack sets and capacitated lot-sizing","volume":"95","author":"Loparic","year":"2003","journal-title":"Math. Program."},{"issue":"1","key":"10.1016\/j.cor.2017.11.006_bib0026","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.38.1.127","article-title":"Polyhedral characterization of discrete dynamic programming","volume":"38","author":"Martin","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/j.cor.2017.11.006_bib0027","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10107-002-0340-z","article-title":"A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterization for a special case","volume":"95","author":"Miller","year":"2003","journal-title":"Math. Program."},{"key":"10.1016\/j.cor.2017.11.006_bib0028","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10107-002-0325-y","article-title":"On the polyhedral structure of a multi-item production planning model with setup times","volume":"94","author":"Miller","year":"2003","journal-title":"Math. Program."},{"issue":"4","key":"10.1016\/j.cor.2017.11.006_bib0029","doi-asserted-by":"crossref","first-page":"842","DOI":"10.1287\/opre.33.4.842","article-title":"Valid linear inequalities for fixed charge problems","volume":"33","author":"Padberg","year":"1985","journal-title":"Oper. Res."},{"issue":"3","key":"10.1016\/j.cor.2017.11.006_bib0030","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0167-6377(88)90076-4","article-title":"Valid inequalities and separation for capacitated economic lot sizing","volume":"7","author":"Pochet","year":"1988","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"10.1016\/j.cor.2017.11.006_bib0031","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1287\/mnsc.37.1.53","article-title":"Solving multi-item lot-sizing problems using strong cutting planes","volume":"37","author":"Pochet","year":"1991","journal-title":"Manage. Sci."},{"issue":"4","key":"10.1016\/j.cor.2017.11.006_bib0032","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1287\/moor.18.4.767","article-title":"Lot-sizing with constant batches: formulation and valid inequalities","volume":"18","author":"Pochet","year":"1993","journal-title":"Math. Oper. Res."},{"year":"2006","series-title":"Production Planning by Mixed Integer Programming","author":"Pochet","key":"10.1016\/j.cor.2017.11.006_bib0033"},{"key":"10.1016\/j.cor.2017.11.006_bib0034","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/s10107-003-0398-2","article-title":"Lifted inequalities for 0-1 mixed integer programming: basic theory and algorithms","volume":"98","author":"Richard","year":"2003","journal-title":"Math. Program."},{"issue":"1-2","key":"10.1016\/j.cor.2017.11.006_bib0035","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10107-013-0702-8","article-title":"Relaxations for two-level multi-item lot-sizing problems","volume":"146","author":"Van Vyve","year":"2014","journal-title":"Math. Program."},{"issue":"14","key":"10.1016\/j.cor.2017.11.006_bib0036","doi-asserted-by":"crossref","first-page":"3133","DOI":"10.1016\/j.dam.2009.06.010","article-title":"Polyhedral analysis for the two-item uncapacitated lot-sizing problem with one-way substitution","volume":"157","author":"Yaman","year":"2009","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"10.1016\/j.cor.2017.11.006_bib0037","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1287\/opre.1120.1058","article-title":"A polyhedral study of multiechelon lot sizing with intermediate demands","volume":"60","author":"Zhang","year":"2012","journal-title":"Oper. Res."}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054817302824?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054817302824?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,4,6]],"date-time":"2024-04-06T17:18:44Z","timestamp":1712423924000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054817302824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3]]},"references-count":37,"alternative-id":["S0305054817302824"],"URL":"https:\/\/doi.org\/10.1016\/j.cor.2017.11.006","relation":{},"ISSN":["0305-0548"],"issn-type":[{"type":"print","value":"0305-0548"}],"subject":[],"published":{"date-parts":[[2018,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Partial objective inequalities for the multi-item capacitated lot-sizing problem","name":"articletitle","label":"Article Title"},{"value":"Computers & Operations Research","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.cor.2017.11.006","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2017 Elsevier Ltd. All rights reserved.","name":"copyright","label":"Copyright"}]}}