{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T12:56:09Z","timestamp":1773752169076,"version":"3.50.1"},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,8,15]],"date-time":"2007-08-15T00:00:00Z","timestamp":1187136000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2008,10]]},"DOI":"10.1007\/s00291-007-0094-3","type":"journal-article","created":{"date-parts":[[2007,8,14]],"date-time":"2007-08-14T11:48:09Z","timestamp":1187092089000},"page":"773-785","source":"Crossref","is-referenced-by-count":21,"title":["Equivalence of the LP relaxations of two strong formulations for the capacitated lot-sizing problem with setup times"],"prefix":"10.1007","volume":"30","author":[{"given":"Meltem","family":"Denizel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"F. Tevhide","family":"Altekin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Haldun","family":"S\u00fcral","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hartmut","family":"Stadtler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,8,15]]},"reference":[{"issue":"2","key":"94_CR1","doi-asserted-by":"crossref","first-page":"441","DOI":"10.1080\/00207540110081461","volume":"40","author":"A Alfieri","year":"2002","unstructured":"Alfieri A, Brandimarte P, D\u2019Orazio S (2002) LP-based heuristics for the capacitated lot-sizing problem: the interaction of model formulation and solution algorithm. Int J Prod Res 40(2):441\u2013458","journal-title":"Int J Prod Res"},{"key":"94_CR2","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02248584","volume":"26","author":"WH Chen","year":"1990","unstructured":"Chen WH, Thizy JM (1990) Analysis of relaxations for the multi-item capacitated lot-sizing problem. Ann Oper Res 26:29\u201372","journal-title":"Ann Oper Res"},{"issue":"4","key":"94_CR3","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1057\/palgrave.jors.2601996","volume":"57","author":"M Denizel","year":"2006","unstructured":"Denizel M, S\u00fcral H (2006) On alternative mixed integer programming formulations and LP based heuristics for lot-sizing with setup times. J Oper Res Soc 57(4):389\u2013399","journal-title":"J Oper Res Soc"},{"key":"94_CR4","unstructured":"Denizel M, Altekin FT, S\u00fcral H (2005) Equivalence of the LP relaxation solutions of two MIP formulations for the capacitated lot-sizing problem with setups. Working paper no: SUGSM-05-09, Faculty of Management, Sabanci University, Istanbul"},{"key":"94_CR5","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper Res 35:832\u2013848","journal-title":"Oper Res"},{"issue":"2","key":"94_CR6","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/j.orl.2003.06.001","volume":"32","author":"R Jans","year":"2004","unstructured":"Jans R, Degraeve Z (2004) Improved lower bounds for the capacitated lot sizing problem with setup times. Oper Res Lett 32(2):185\u2013195","journal-title":"Oper Res Lett"},{"key":"94_CR7","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi B, Fatemi Ghomi SMT, Wilson JM (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31:365\u2013378","journal-title":"Omega"},{"key":"94_CR8","doi-asserted-by":"crossref","unstructured":"Krarup J, Bilde O (1977) Plant location, set covering and economic lot size: An O(mn)-algorithm for structured problems. In: Numerische methoden bei optimierungsaufgaben, band 3: Optimierung bei graphentheoritischen ganzzahligen problemen, Birkhauser, pp 155\u2013186","DOI":"10.1007\/978-3-0348-5936-3_10"},{"issue":"2","key":"94_CR9","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0377-2217(91)90130-N","volume":"53","author":"J Maes","year":"1991","unstructured":"Maes J, McClain JO, Van Wassenhove LN (1991) Multilevel capacitated lot sizing complexity and LP-based heuristics. Eur J Oper Res 53(2):131\u2013148","journal-title":"Eur J Oper Res"},{"key":"94_CR10","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and combinatorial optimization","author":"GL Nemhauser","year":"1988","unstructured":"Nemhauser GL, Wolsey LA (1988) Integer and combinatorial optimization. Wiley, New York"},{"key":"94_CR11","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1016\/0377-2217(95)00094-1","volume":"94","author":"H Stadtler","year":"1996","unstructured":"Stadtler H (1996a) Mixed integer programming model formulations for dynamic multi-item multi-level capacitated lotsizing. Eur J Oper Res 94:561\u2013581","journal-title":"Eur J Oper Res"},{"key":"94_CR12","doi-asserted-by":"crossref","unstructured":"Stadtler H (1996b) On the equivalence of LP bounds provided by the shortest route and the simple plant location model formulation for dynamic multi-item multi-level capacitated lot-sizing, Schriften zur Quantitativen Betriebswirtschaftslehre, Technische Hochschule Darmstadt, 5\/96, Darmstadt","DOI":"10.1007\/BF01545506"},{"key":"94_CR13","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1007\/BF01545506","volume":"19","author":"H Stadtler","year":"1997","unstructured":"Stadtler H (1997) Reformulations of the shortest route model for dynamic multi-item multi-level lotsizing. OR Spektrum 19:87\u201396","journal-title":"OR Spektrum"},{"key":"94_CR14","unstructured":"S\u00fcral H, Denizel M, Van Wassenhove LN (2006) Lagrangean relaxation based heuristics for lot sizing with setup times. Working paper no: SUGSM-06-01, Faculty of Management, Sabanci University, Istanbul"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-007-0094-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-007-0094-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-007-0094-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,25]],"date-time":"2020-04-25T21:12:27Z","timestamp":1587849147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-007-0094-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8,15]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,10]]}},"alternative-id":["94"],"URL":"https:\/\/doi.org\/10.1007\/s00291-007-0094-3","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8,15]]}}}