{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,9]],"date-time":"2025-11-09T11:08:12Z","timestamp":1762686492193,"version":"3.37.3"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T00:00:00Z","timestamp":1476403200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["IR 122\/6-1"],"award-info":[{"award-number":["IR 122\/6-1"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s00291-016-0463-x","type":"journal-article","created":{"date-parts":[[2016,10,14]],"date-time":"2016-10-14T01:47:13Z","timestamp":1476409633000},"page":"541-556","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Stabilized column generation for the temporal knapsack problem using dual-optimal inequalities"],"prefix":"10.1007","volume":"39","author":[{"given":"Timo","family":"Gschwind","sequence":"first","affiliation":[]},{"given":"Stefan","family":"Irnich","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,14]]},"reference":[{"key":"463_CR1","doi-asserted-by":"publisher","unstructured":"Bartlett M, Frisch A, Hamadi Y, Miguel I, Tarim S, Unsworth C (2005) The temporal knapsack problem and its solution. In: Bart\u00e1k R, Milano M (eds) Integration of AI and OR techniques in constraint programming for combinatorial optimization problems, Lecture notes in computer science, vol 3524, Springer, Berlin, pp 34\u201348, doi: 10.1007\/11493853_5","DOI":"10.1007\/11493853_5"},{"issue":"3","key":"463_CR2","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1287\/opre.1060.0278","volume":"54","author":"H Ben Amor","year":"2006","unstructured":"Ben Amor H, Desrosiers J, Val\u00e9rio de Carvalho JM (2006) Dual-optimal inequalities for stabilized column generation. Oper Res 54(3):454\u2013463. doi: 10.1287\/opre.1060.0278","journal-title":"Oper Res"},{"issue":"2","key":"463_CR3","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1287\/trsc.1100.0348","volume":"45","author":"A Caprara","year":"2011","unstructured":"Caprara A, Malaguti E, Toth P (2011) A freight service design problem for a railway corridor. Transp Sci 45(2):147\u2013162. doi: 10.1287\/trsc.1100.0348","journal-title":"Transp Sci"},{"issue":"3","key":"463_CR4","doi-asserted-by":"crossref","first-page":"560","DOI":"10.1287\/ijoc.1120.0521","volume":"25","author":"A Caprara","year":"2013","unstructured":"Caprara A, Furini F, Malaguti E (2013) Uncommon Dantzig-Wolfe reformulation for the temporal knapsack problem. INFORMS J Comput 25(3):560\u2013571","journal-title":"INFORMS J Comput"},{"issue":"5","key":"463_CR5","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1016\/j.ipl.2016.01.008","volume":"116","author":"A Caprara","year":"2016","unstructured":"Caprara A, Furini F, Malaguti E, Traversi E (2016) Solving the temporal knapsack problem via recursive Dantzig\u2013Wolfe reformulation. Inf Process Lett 116(5):379\u2013386. doi: 10.1016\/j.ipl.2016.01.008","journal-title":"Inf Process Lett"},{"volume-title":"Column generation","year":"2005","key":"463_CR6","unstructured":"Desaulniers G, Desrosiers J, Solomon M (eds) (2005) Column generation. Springer, New York"},{"issue":"2","key":"463_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1016\/j.ejor.2013.12.016","volume":"236","author":"J Desrosiers","year":"2014","unstructured":"Desrosiers J, Gauthier JB, L\u00fcbbecke ME (2014) Row-reduced column generation for degenerate master problems. Eur J Oper Res 236(2):453\u2013460. doi: 10.1016\/j.ejor.2013.12.016","journal-title":"Eur J Oper Res"},{"issue":"2","key":"463_CR8","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/s101070100263","volume":"91","author":"ED Dolan","year":"2002","unstructured":"Dolan ED, Mor\u00e9 JJ (2002) Benchmarking optimization software with performance profiles. Math Program 91(2):201\u2013213. doi: 10.1007\/s101070100263","journal-title":"Math Program"},{"key":"463_CR9","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/S0012-365X(98)00213-1","volume":"194","author":"O Merle du","year":"1999","unstructured":"du Merle O, Villeneuve D, Desrosiers J, Hansen P (1999) Stabilized column generation. Discrete Math 194:229\u2013237","journal-title":"Discrete Math"},{"key":"463_CR10","doi-asserted-by":"publisher","unstructured":"Gauthier JB, Desrosiers J, L\u00fcbbecke ME (2016) Tools for primal degenerate linear programs. EURO J Transport Logist 5(2):161\u2013204. doi: 10.1007\/s13676-015-0077-5","DOI":"10.1007\/s13676-015-0077-5"},{"key":"463_CR11","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P Gilmore","year":"1961","unstructured":"Gilmore P, Gomory R (1961) A linear programming approach to the cutting-stock problem. Oper Res 9:849\u2013859","journal-title":"Oper Res"},{"issue":"1","key":"463_CR12","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.2015.0670","volume":"28","author":"T Gschwind","year":"2016","unstructured":"Gschwind T, Irnich S (2016) Dual inequalities for stabilized column generation revisited. INFORMS J Comput 28(1):175\u2013194","journal-title":"INFORMS J Comput"},{"key":"463_CR13","volume-title":"Convex analysis and minimization algorithms, part 2: advanced theory and bundle methods, Grundlehren der mathematischen Wissenschaften","author":"JB Hiriart-Urruty","year":"1993","unstructured":"Hiriart-Urruty JB, Lemar\u00e9chal C (1993) Convex analysis and minimization algorithms, part 2: advanced theory and bundle methods, Grundlehren der mathematischen Wissenschaften, vol 306. Springer, Berlin"},{"key":"463_CR14","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack problems","author":"H Kellerer","year":"2004","unstructured":"Kellerer H, Pferschy U, Pisinger D (2004) Knapsack problems. Springer, Berlin"},{"issue":"18","key":"463_CR15","doi-asserted-by":"publisher","first-page":"2251","DOI":"10.1016\/j.dam.2011.08.009","volume":"159","author":"C Lee","year":"2011","unstructured":"Lee C, Park S (2011) Chebyshev center based column generation. Discrete Appl Math 159(18):2251\u20132265. doi: 10.1016\/j.dam.2011.08.009","journal-title":"Discrete Appl Math"},{"issue":"6","key":"463_CR16","doi-asserted-by":"crossref","first-page":"1007","DOI":"10.1287\/opre.1050.0234","volume":"53","author":"M L\u00fcbbecke","year":"2005","unstructured":"L\u00fcbbecke M, Desrosiers J (2005) Selected topics in column generation. Oper Res 53(6):1007\u20131023","journal-title":"Oper Res"},{"key":"463_CR17","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","volume":"23","author":"R Marsten","year":"1975","unstructured":"Marsten R, Hogan W, Blankenship J (1975) The boxstep method for large-scale optimization. Oper Res 23:389\u2013405","journal-title":"Oper Res"},{"key":"463_CR18","unstructured":"Poggi de Aragao M, Uchoa E (2003) Integer program reformulation for robust branch-and-cut-and-price algorithms. In: Proc. Conf. Math. Program in Rio: A Conference in Honour of Nelson Maculan, Rio de Janeiro, Brazil, pp 56\u201361"},{"issue":"5","key":"463_CR19","doi-asserted-by":"publisher","first-page":"660","DOI":"10.1016\/j.orl.2006.11.004","volume":"35","author":"LM Rousseau","year":"2007","unstructured":"Rousseau LM, Gendreau M, Feillet D (2007) Interior point stabilization for column generation. Oper Res Lett 35(5):660\u2013668. doi: 10.1016\/j.orl.2006.11.004","journal-title":"Oper Res Lett"},{"issue":"2","key":"463_CR20","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1030.0060","volume":"17","author":"JM Val\u00e9rio de Carvalho","year":"2005","unstructured":"Val\u00e9rio de Carvalho JM (2005) Using extra dual cuts to accelerate column generation. INFORMS J Comput 17(2):175\u2013182","journal-title":"INFORMS J Comput"},{"key":"463_CR21","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/0-387-25486-2_12","volume-title":"Column generation","author":"F Vanderbeck","year":"2005","unstructured":"Vanderbeck F (2005) Implementing mixed integer column generation. In: Desaulniers G, Desrosiers J, Solomon M (eds) Column generation. Springer, New York, pp 331\u2013358 (chap 12)"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0463-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-016-0463-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-016-0463-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:07:44Z","timestamp":1498338464000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-016-0463-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,14]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["463"],"URL":"https:\/\/doi.org\/10.1007\/s00291-016-0463-x","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"type":"print","value":"0171-6468"},{"type":"electronic","value":"1436-6304"}],"subject":[],"published":{"date-parts":[[2016,10,14]]}}}