{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:42:11Z","timestamp":1725896531156},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642344121"},{"type":"electronic","value":"9783642344138"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-34413-8_3","type":"book-chapter","created":{"date-parts":[[2012,10,1]],"date-time":"2012-10-01T01:58:57Z","timestamp":1349056737000},"page":"31-41","source":"Crossref","is-referenced-by-count":3,"title":["A Math-Heuristic Dantzig-Wolfe Algorithm for the Capacitated Lot Sizing Problem"],"prefix":"10.1007","author":[{"given":"Marco","family":"Caserta","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Vo\u00df","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_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":"3_CR2","doi-asserted-by":"publisher","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. Operations Research\u00a046(3), 316\u2013329 (1998)","journal-title":"Operations Research"},{"issue":"5","key":"3_CR3","doi-asserted-by":"publisher","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. Management Science\u00a046(5), 724\u2013738 (2000)","journal-title":"Management Science"},{"issue":"3","key":"3_CR4","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF02592189","volume":"75","author":"M. Constantino","year":"1996","unstructured":"Constantino, M.: A Cutting Plane Approach to Capacitated Lot-Sizing with Start-up Costs. Mathematical Programming B\u00a075(3), 353\u2013376 (1996)","journal-title":"Mathematical Programming B"},{"issue":"9","key":"3_CR5","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1287\/mnsc.11.9.874","volume":"11","author":"M.A.H. Dzielinski","year":"1965","unstructured":"Dzielinski, M.A.H., Gomory, R.E.: Optimal Programming of Lot-Sizing Inventory and Labor Allocation. Management Science\u00a011(9), 874\u2013890 (1965)","journal-title":"Management Science"},{"issue":"6","key":"3_CR6","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"G.D. Eppen","year":"1987","unstructured":"Eppen, G.D., Martin, R.K.: Solving Multi-Item Lot-Sizing Problems Using Variable Redefinition. Operations Research\u00a035(6), 832\u2013848 (1987)","journal-title":"Operations Research"},{"issue":"5","key":"3_CR7","doi-asserted-by":"publisher","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. Operations Research\u00a055(5), 909\u2013920 (2007)","journal-title":"Operations Research"},{"issue":"3","key":"3_CR8","doi-asserted-by":"publisher","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. European Journal of Operational Research\u00a0177(3), 1855\u20131875 (2007)","journal-title":"European Journal of Operational Research"},{"key":"3_CR9","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.\u00a010. Springer (2010)","DOI":"10.1007\/978-1-4419-1306-7"},{"issue":"2","key":"3_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1287\/mnsc.4.2.115","volume":"4","author":"A.S. Manne","year":"1958","unstructured":"Manne, A.S.: Programming of Economic Lot Sizes. Management Science\u00a04(2), 115\u2013135 (1958)","journal-title":"Management Science"},{"key":"3_CR11","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 (August 2000)"},{"key":"3_CR12","unstructured":"Nemhauser, G.L., Wolsey, L.A.: Integer and Combinatorial Optimization. Wiley-Interscience Series in Discrete Mathematics and Optimization. Wiley (1999)"},{"issue":"1-3","key":"3_CR13","doi-asserted-by":"publisher","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. Mathematical Programming B\u00a067(1-3), 297\u2013323 (1994)","journal-title":"Mathematical Programming B"},{"issue":"3","key":"3_CR14","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 and Cybernetics\u00a035(3), 551\u2013578 (2006)","journal-title":"Control and Cybernetics"},{"issue":"3","key":"3_CR15","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1287\/mnsc.35.3.353","volume":"35","author":"W.W. Trigeiro","year":"1989","unstructured":"Trigeiro, W.W., Thomas, L.J., McClain, J.O.: Capacitated Lot-sizing With Setup Times. Management Science\u00a035(3), 353\u2013366 (1989)","journal-title":"Management Science"},{"issue":"3","key":"3_CR16","doi-asserted-by":"publisher","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. Operations Research Letters\u00a034(3), 296\u2013306 (2006)","journal-title":"Operations Research Letters"}],"container-title":["Lecture Notes in Computer Science","Learning and Intelligent Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-34413-8_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T21:13:53Z","timestamp":1558300433000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-34413-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642344121","9783642344138"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-34413-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}