{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T22:57:12Z","timestamp":1770418632995,"version":"3.49.0"},"reference-count":33,"publisher":"Informa UK Limited","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Methods and Software"],"published-print":{"date-parts":[[2010,4]]},"DOI":"10.1080\/10556780902992837","type":"journal-article","created":{"date-parts":[[2009,8,24]],"date-time":"2009-08-24T18:06:25Z","timestamp":1251137185000},"page":"299-319","source":"Crossref","is-referenced-by-count":17,"title":["Comparing Dantzig\u2013Wolfe decompositions and branch-and-price algorithms for the multi-item capacitated lot\u00a0sizing problem"],"prefix":"10.1080","volume":"25","author":[{"given":"Carina Maria Oliveira","family":"Pimentel","sequence":"first","affiliation":[{"name":"Universidade do Minho","place":["Portugal"]}]},{"given":"Filipe Pereira e","family":"Alvelos","sequence":"additional","affiliation":[{"name":"Universidade do Minho","place":["Portugal"]},{"name":"Universidade do Minho","place":["Portugal"]}]},{"given":"Jos\u00e9 Manuel","family":"Val\u00e9rio de Carvalho","sequence":"additional","affiliation":[{"name":"Universidade do Minho","place":["Portugal"]},{"name":"Universidade do Minho","place":["Portugal"]}]}],"member":"301","published-online":{"date-parts":[[2009,8,24]]},"reference":[{"key":"e_1_3_2_2_1","unstructured":"Alvelos F. 2005 . \u201c Branch-and-price and multicommodity flows \u201d . Universidade do Minho . Ph.D. Thesis"},{"key":"e_1_3_2_3_1","unstructured":"Arag\u00e3o M. and Uchoa E. 2003 . Integer program reformulation for robust branch-and-cut-and-price algorithms . Working Paper"},{"key":"e_1_3_2_4_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.46.3.316"},{"key":"e_1_3_2_5_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.46.5.724.12048"},{"key":"e_1_3_2_6_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.28.10.1174"},{"key":"e_1_3_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02248584"},{"key":"e_1_3_2_8_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.8.1.101"},{"key":"e_1_3_2_9_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1070.0404"},{"key":"e_1_3_2_10_1","doi-asserted-by":"crossref","DOI":"10.1007\/b135457","volume-title":"Column Generation (GERAD 25th Anniversary Series)","author":"Desaulniers G.","year":"2005","unstructured":"Desaulniers , G. , Desrosiers , J. and Solomon , M. 2005 . Column Generation (GERAD 25th Anniversary Series) , New York : Springer ."},{"key":"e_1_3_2_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(92)90201-J"},{"key":"e_1_3_2_12_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.38.9.1329"},{"key":"e_1_3_2_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(97)00030-1"},{"key":"e_1_3_2_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.6.832"},{"key":"e_1_3_2_15_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.97"},{"key":"e_1_3_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0120690"},{"key":"e_1_3_2_17_1","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"Linear programming approach to the cutting stock problem: Part I","volume":"9","author":"Gilmory P. C.","year":"1961","unstructured":"Gilmory , P. C. and Gomory , R. E. 1961 . Linear programming approach to the cutting stock problem: Part I . Oper. Res. , 9 : 849 \u2013 859 .","journal-title":"Oper. Res."},{"key":"e_1_3_2_18_1","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","article-title":"Linear programming approach to the cutting stock problem: Part II","volume":"11","author":"Gilmory P. C.","year":"1963","unstructured":"Gilmory , P. C. and Gomory , R. E. 1963 . Linear programming approach to the cutting stock problem: Part II . Oper. Res. , 11 : 863 \u2013 888 .","journal-title":"Oper. Res."},{"key":"e_1_3_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02592954"},{"key":"e_1_3_2_20_1","unstructured":"ILOG CPLEX 8.1 User's Manual 2002. Available at http:\/\/www.ilog.com"},{"key":"e_1_3_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2003.06.001"},{"key":"e_1_3_2_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0305-0483(03)00059-8"},{"key":"e_1_3_2_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(94)90072-8"},{"key":"e_1_3_2_24_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.1050.0234"},{"key":"e_1_3_2_25_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.4.2.115"},{"key":"e_1_3_2_26_1","volume-title":"Proceedings of the 2003 International Network Optimization Conference","author":"Park S.","unstructured":"Park , S. , Kim , D. and Lee , K. An integer programming approach to the path selection problem . Proceedings of the 2003 International Network Optimization Conference . Evry\/Paris."},{"key":"e_1_3_2_27_1","unstructured":"Perrot N. and Vanderbeck F. 2004 . \u201c Knapsack problems with setups \u201d . Tech. Rep. Universit\u00e9 Bordeaux ."},{"key":"e_1_3_2_28_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.37.1.53"},{"key":"e_1_3_2_29_1","volume-title":"Production Planning by Mixed Integer Programming","author":"Pochet Y.","year":"2006","unstructured":"Pochet , Y. and Wolsey , L. A. 2006 . Production Planning by Mixed Integer Programming , USA : Springer ."},{"key":"e_1_3_2_30_1","doi-asserted-by":"publisher","DOI":"10.1080\/07408178508975308"},{"key":"e_1_3_2_31_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.35.3.353"},{"key":"e_1_3_2_32_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.40.1.S145"},{"key":"e_1_3_2_33_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.5.1.89"},{"key":"e_1_3_2_34_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013141227104"}],"container-title":["Optimization Methods and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/10556780902992837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,6]],"date-time":"2026-02-06T11:07:57Z","timestamp":1770376077000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/10556780902992837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,8,24]]},"references-count":33,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,4]]}},"alternative-id":["10.1080\/10556780902992837"],"URL":"https:\/\/doi.org\/10.1080\/10556780902992837","relation":{},"ISSN":["1055-6788","1029-4937"],"issn-type":[{"value":"1055-6788","type":"print"},{"value":"1029-4937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,8,24]]}}}