{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,21]],"date-time":"2026-09-21T04:34:22Z","timestamp":1789965262756,"version":"4.0.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,3,28]],"date-time":"2013-03-28T00:00:00Z","timestamp":1364428800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Math Artif Intell"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10472-013-9339-9","type":"journal-article","created":{"date-parts":[[2013,3,27]],"date-time":"2013-03-27T06:22:36Z","timestamp":1364365356000},"page":"207-224","source":"Crossref","is-referenced-by-count":13,"title":["A math-heuristic Dantzig-Wolfe algorithm for capacitated lot sizing"],"prefix":"10.1007","volume":"69","author":[{"given":"Marco","family":"Caserta","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,3,28]]},"reference":[{"key":"9339_CR1","unstructured":"Aras, O.A: A Heuristic Solution Procedure for a Single-Facility Multi-Item Dynamic Lot Sizing and Sequencing Problem. PhD thesis, Syracuse University (1981)"},{"issue":"3","key":"9339_CR2","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1998","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch and price: column generation for huge integer programs. Oper. Res 46(3), 316\u2013329 (1998)","journal-title":"Oper. Res"},{"issue":"5","key":"9339_CR3","doi-asserted-by":"crossref","first-page":"724","DOI":"10.1287\/mnsc.46.5.724.12048","volume":"46","author":"G Belvaux","year":"2000","unstructured":"Belvaux, G., Wolsey, L.A.: BC-PROD: a specialized branch-and-cut system for lot-sizing problems. Manage. Sci. 46(5), 724\u2013738 (2000)","journal-title":"Manage. Sci."},{"key":"9339_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.2517-6161.1951.tb00067.x","volume":"13","author":"GEP Box","year":"1951","unstructured":"Box, G.E.P., Wilson, K.B.: On the experimental attainment of optimum conditions. J. R. Stat. Soc. Ser. B 13, 1\u201345 (1951)","journal-title":"J. R. Stat. Soc. Ser. B"},{"key":"9339_CR5","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/s12469-011-0039-8","volume":"3","author":"G Bruno","year":"2012","unstructured":"Bruno, G., Genovese, A., Sgalambro, A.: An extension of the schedule optimization problem at a public transit terminal to the multiple destinations case. Public Transp. 3, 189\u2013198 (2012)","journal-title":"Public Transp."},{"key":"9339_CR6","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1016\/j.cor.2007.10.014","volume":"36","author":"M Caserta","year":"2009","unstructured":"Caserta, M., Qui\u00f1onez, E.: A cross entropy-Lagrangean hybrid algorithm for the multi-item capacitated lot-sizing problem with setups. Comput. Oper. Res. 36, 530\u2013548 (2009)","journal-title":"Comput. Oper. Res."},{"key":"9339_CR7","unstructured":"Caserta, M., Vo\u00df, S.: A math-heuristic Dantzig-Wolfe algorithm for the capacitated lot sizing problem. Lecture Notes in Computer Science, vol. 7219, pp. 31\u201341 (2012). Presented at LION 6"},{"issue":"3","key":"9339_CR8","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/BF02592189","volume":"B75","author":"M Constantino","year":"1996","unstructured":"Constantino, M.: A cutting plane approach to capacitated lot-sizing with start-up costs. Math. Program. B75(3), 353\u2013376 (1996)","journal-title":"Math. Program."},{"key":"9339_CR9","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"GB Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Oper. Res. 8, 101\u2013111 (1960)","journal-title":"Oper. Res."},{"key":"9339_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61684-6","volume-title":"Produktionsplanung: Ablauforganisatorische Aspekte","author":"W Domschke","year":"1997","unstructured":"Domschke, W., Scholl, A., Vo\u00df S.: Produktionsplanung: Ablauforganisatorische Aspekte, 2nd edn. Springer, Berlin (1997)","edition":"2"},{"issue":"9","key":"9339_CR11","doi-asserted-by":"crossref","first-page":"874","DOI":"10.1287\/mnsc.11.9.874","volume":"11","author":"MAH Dzielinski","year":"1965","unstructured":"Dzielinski, M.A.H., Gomory, R.E.: Optimal programming of lot-sizing inventory and labor allocation. Manage. Sci. 11(9), 874\u2013890 (1965)","journal-title":"Manage. Sci."},{"issue":"6","key":"9339_CR12","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen, G.D., Martin, R.K.: Solving multi-item lot-sizing problems using variable redefinition. Oper. Res. 35(6), 832\u2013848 (1987)","journal-title":"Oper. Res."},{"key":"9339_CR13","doi-asserted-by":"crossref","first-page":"634","DOI":"10.1287\/moor.12.4.634","volume":"12","author":"RE Erickson","year":"1987","unstructured":"Erickson, R.E., Monma, C.L., Veinott, A.F.: Send-and-split methods for minimum-concave-cost network flows. Math. Oper. Res. 12, 634\u2013664 (1987)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"9339_CR14","doi-asserted-by":"crossref","first-page":"909","DOI":"10.1287\/opre.1070.0404","volume":"55","author":"R Jans","year":"2007","unstructured":"Jans, R., Degraeve, Z.: A new Dantzig-Wolfe reformulation and branch-and-price algorithm for the capacitated lot sizing problem with setup times. Oper. Res. 55(5), 909\u2013920 (2007)","journal-title":"Oper. Res."},{"issue":"3","key":"9339_CR15","doi-asserted-by":"crossref","first-page":"1855","DOI":"10.1016\/j.ejor.2005.12.008","volume":"177","author":"R Jans","year":"2007","unstructured":"Jans, R., Degraeve, Z.: Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches. Eur. J. Oper. Res. 177(3), 1855\u20131875 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6","key":"9339_CR16","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1080\/00207540600902262","volume":"46","author":"R Jans","year":"2008","unstructured":"Jans, R., Degraeve, Z.: Modeling industrial lot sizing problems: a review. Int. J. Prod. Res. 46(6), 1619\u20131643 (2008)","journal-title":"Int. J. Prod. Res."},{"key":"9339_CR17","doi-asserted-by":"crossref","unstructured":"Maniezzo, V., St\u00fctzle, T., Vo\u00df, S. eds.: Matheuristics \u2013 Hybridizing Metaheuristics and Mathematical Programming. Annals of Information Systems, vol. 10. Springer (2010)","DOI":"10.1007\/978-1-4419-1306-7"},{"issue":"2","key":"9339_CR18","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1287\/mnsc.4.2.115","volume":"4","author":"AS Manne","year":"1958","unstructured":"Manne, A.S.: Programming of economic lot sizes. Manage. Sci. 4(2), 115\u2013135 (1958)","journal-title":"Manage. Sci."},{"key":"9339_CR19","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1007\/s10479-006-0157-x","volume":"150","author":"F Marinelli","year":"2007","unstructured":"Marinelli, F., Nenni, M.E., Sforza, A.: Capacitated lot sizing and scheduling with parallel machines and shared buffers: a case study in a packaging company. Ann. Oper. Res. 150, 177\u2013192 (2007)","journal-title":"Ann. Oper. Res."},{"key":"9339_CR20","unstructured":"Miller, A.J., Nemhauser, G.L., Savelsbergh, M.W.: Solving Multi-Item Capacitated Lot-Sizing Problems with Setup Times by Branch and Cut. Core dp 2000\/39, Universit\u00e9 Catholique de Louvain, Louvain-la-Neuve, Belgium (2000)"},{"issue":"4","key":"9339_CR21","doi-asserted-by":"crossref","first-page":"680","DOI":"10.1287\/opre.30.4.680","volume":"30","author":"S Nahmias","year":"1982","unstructured":"Nahmias, S.: Perishable inventory theory: a review. Oper. Res. 30(4), 680\u2013708 (1982)","journal-title":"Oper. Res."},{"key":"9339_CR22","volume-title":"Integer and Combinatorial Optimization","author":"GL Nemhauser","year":"1999","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley, New York (1999)"},{"key":"9339_CR23","unstructured":"Pahl, J., Vo\u00df, S., Woodruff, D.L.: Production planning with deterioration constraints: a survey. In: Ceroni, J.A. (ed.) The Development of Collaborative Production and Service Systems in Emergent Economies, Proceedings of the 19th International Conference on Production Research, IFPR, pages Tu3.4\u20136, 1\u20136. Valparaiso, Chile (2007)"},{"issue":"1\u20133","key":"9339_CR24","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01582225","volume":"67","author":"Y Pochet","year":"1994","unstructured":"Pochet, Y., Wolsey, L.A.: Polyhedra for lot sizing with Wagner-Whitin costs. Math. Program. B 67(1\u20133), 297\u2013323 (1994)","journal-title":"Math. Program. B"},{"issue":"3","key":"9339_CR25","first-page":"551","volume":"35","author":"M Sniedovich","year":"2006","unstructured":"Sniedovich, M., Vo\u00df, S.: The corridor method: a dynamic programming inspired metaheuristic. Control Cybern. 35(3), 551\u2013578 (2006)","journal-title":"Control Cybern."},{"issue":"3","key":"9339_CR26","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","volume":"35","author":"WW Trigeiro","year":"1989","unstructured":"Trigeiro, W.W., Thomas, L.J., McClain, J.O.: Capacitated lot-sizing with setup times. Manage. Sci. 35(3), 353\u2013366 (1989)","journal-title":"Manage. Sci."},{"issue":"3","key":"9339_CR27","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","volume":"34","author":"F Vanderbeck","year":"2006","unstructured":"Vanderbeck, F., Savelsbergh, M.W.P.: A generic view of Dantzig-Wolfe decomposition in mixed integer programming. Oper. Res. Lett. 34(3), 296\u2013306 (2006)","journal-title":"Oper. Res. Lett."},{"key":"9339_CR28","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1018967121276","volume":"86","author":"S Vo\u00df","year":"1999","unstructured":"Vo\u00df, S.: The Steiner tree problem with hop constraints. Ann. Oper. Res. 86, 321\u2013345 (1999)","journal-title":"Ann. Oper. Res."},{"key":"9339_CR29","volume-title":"An Introduction to Computational Optimization Models for Production Planning in a Supply Chain","author":"S Vo\u00df","year":"2006","unstructured":"Vo\u00df, S., Woodruff, D.L.: An Introduction to Computational Optimization Models for Production Planning in a Supply Chain, 2nd edn. Springer, Berlin (2006)","edition":"2"},{"key":"9339_CR30","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1287\/mnsc.5.1.89","volume":"5","author":"HM Wagner","year":"1958","unstructured":"Wagner, H.M., Whitin, T.M.: Dynamic version of the economic lot size model. Manage. Sci. 5, 89\u201396 (1958)","journal-title":"Manage. Sci."}],"container-title":["Annals of Mathematics and Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9339-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10472-013-9339-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10472-013-9339-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T01:12:51Z","timestamp":1715130771000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10472-013-9339-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,28]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["9339"],"URL":"https:\/\/doi.org\/10.1007\/s10472-013-9339-9","relation":{},"ISSN":["1012-2443","1573-7470"],"issn-type":[{"value":"1012-2443","type":"print"},{"value":"1573-7470","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,3,28]]}}}