{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T12:11:28Z","timestamp":1773317488538,"version":"3.50.1"},"reference-count":29,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T00:00:00Z","timestamp":1367366400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["EURO Journal on Computational Optimization"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s13675-013-0009-9","type":"journal-article","created":{"date-parts":[[2013,3,13]],"date-time":"2013-03-13T04:55:01Z","timestamp":1363150501000},"page":"81-115","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":22,"title":["Column generation for extended formulations"],"prefix":"10.1016","volume":"1","author":[{"given":"Ruslan","family":"Sadykov","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1007\/s13675-013-0009-9_CR1","series-title":"Network flows: theory algorithms and applications","author":"Ahuja","year":"1993"},{"key":"10.1007\/s13675-013-0009-9_CR2","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/BF01386316","article-title":"Partitioning procedures for solving mixed-variables programming problems","volume":"4","author":"Benders","year":"1962","journal-title":"Numerische mathematik"},{"issue":"1","key":"10.1007\/s13675-013-0009-9_CR3","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1287\/ijoc.1070.0225","article-title":"Time-indexed formulations and the total weighted tardiness problem","volume":"20","author":"Bigras","year":"2008","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-013-0009-9_CR4","unstructured":"Chv\u00e1tal V (1983) Linear programming. Freeman, San Francisco"},{"key":"10.1007\/s13675-013-0009-9_CR5","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/opre.1060.0314","article-title":"Variable disaggregation in network flow problems with piecewise linear costs","volume":"55","author":"Croxton","year":"2007","journal-title":"Oper Res"},{"key":"10.1007\/s13675-013-0009-9_CR6","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2006) Vehicle routing with time windows and split deliveries. Technical Paper 2006\u2013851, Laboratoire d\u2019Informatique d\u2019Avignon"},{"issue":"5","key":"10.1007\/s13675-013-0009-9_CR7","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.orl.2010.06.002","article-title":"A note on branch-and-cut-and-price","volume":"38","author":"Feillet","year":"2010","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-013-0009-9_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1002\/(SICI)1097-0037(199701)29:1<55::AID-NET6>3.0.CO;2-B","article-title":"A branch-and-cut algorithm for the resource-constrained arborescence problem","volume":"29","author":"Fischetti","year":"1996","journal-title":"Networks"},{"issue":"6","key":"10.1007\/s13675-013-0009-9_CR9","doi-asserted-by":"crossref","first-page":"1229","DOI":"10.1016\/j.dam.2008.04.022","article-title":"0-1 reformulations of the multicommodity capacitated network design problem","volume":"157","author":"Frangioni","year":"2009","journal-title":"Discret Appl Math"},{"key":"10.1007\/s13675-013-0009-9_CR10","doi-asserted-by":"crossref","unstructured":"Frangioni A, Gendron B (2012) A stabilized structured Dantzig\u2013Wolfe decomposition method. Math Program (to appear)","DOI":"10.1007\/s10107-012-0626-8"},{"key":"10.1007\/s13675-013-0009-9_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01585162","article-title":"Multicommodity network flows: the impact of formulation on decomposition","volume":"62","author":"Jones","year":"1993","journal-title":"Math Program"},{"key":"10.1007\/s13675-013-0009-9_CR12","doi-asserted-by":"crossref","unstructured":"Kaibel V, Loos A (2010) Branched polyhedral systems. In: Eisenbrand F, Shepherd F (eds) Integer programming and combinatorial optimization, vol 6080 of Lecture Notes in Computer Science. Springer, Berlin\/Heidelberg, pp 177\u2013190","DOI":"10.1007\/978-3-642-13036-6_14"},{"issue":"12","key":"10.1007\/s13675-013-0009-9_CR13","doi-asserted-by":"crossref","first-page":"1637","DOI":"10.1287\/mnsc.44.12.1637","article-title":"Vehicle scheduling in public transit and lagrangean pricing","volume":"44","author":"L\u00f6bel","year":"1998","journal-title":"Manag Sci"},{"issue":"5","key":"10.1007\/s13675-013-0009-9_CR14","doi-asserted-by":"crossref","first-page":"693","DOI":"10.1287\/mnsc.46.5.693.12042","article-title":"A decomposition-based pricing procedure for large-scale linear programs: an application to the linear multicommodity flow problem","volume":"46","author":"Mamer","year":"2000","journal-title":"Manag Sci"},{"issue":"1","key":"10.1007\/s13675-013-0009-9_CR15","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1287\/opre.38.1.127","article-title":"Polyhedral characterization of discrete dynamic programming","volume":"38","author":"Martin","year":"1990","journal-title":"Oper Res"},{"key":"10.1007\/s13675-013-0009-9_CR16","doi-asserted-by":"crossref","unstructured":"Muter I, Birbil I, B\u00fclb\u00fcl K (2012) Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows. Math Program (to appear)","DOI":"10.1007\/s10107-012-0561-8"},{"key":"10.1007\/s13675-013-0009-9_CR17","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1007\/s12532-010-0019-z","article-title":"Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems","volume":"2","author":"Pessoa","year":"2010","journal-title":"Math Program Comput"},{"key":"10.1007\/s13675-013-0009-9_CR18","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","article-title":"A minimal algorithm for the 0-1 knapsack problem","volume":"45","author":"Pisinger","year":"1997","journal-title":"Oper Res"},{"key":"10.1007\/s13675-013-0009-9_CR19","unstructured":"Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer, Heidelberg"},{"issue":"2","key":"10.1007\/s13675-013-0009-9_CR20","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1287\/opre.33.2.363","article-title":"A branch and bound algorithm for the total weighted tardiness problem","volume":"33","author":"Potts","year":"1985","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13675-013-0009-9_CR21","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1287\/ijoc.1030.0060","article-title":"Using extra dual cuts to accelerate column generation","volume":"17","author":"Val\u00e9rio de Carvalho","year":"2005","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-013-0009-9_CR22","doi-asserted-by":"crossref","unstructured":"Val\u00e9rio de Carvalho JM (1999) Exact solution of bin packing problems using column generation and branch and bound. Annals Oper Res 86:629\u2013659","DOI":"10.1023\/A:1018952112615"},{"issue":"6","key":"10.1007\/s13675-013-0009-9_CR23","doi-asserted-by":"crossref","first-page":"862","DOI":"10.1287\/opre.47.6.862","article-title":"Parallel machine scheduling by column generation","volume":"47","author":"van den Akker","year":"1999","journal-title":"Oper Res"},{"issue":"2","key":"10.1007\/s13675-013-0009-9_CR24","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1287\/ijoc.12.2.111.11896","article-title":"Time-indexed formulations for machine scheduling problems: column generation","volume":"12","author":"van den Akker","year":"2000","journal-title":"INFORMS J Comput"},{"key":"10.1007\/s13675-013-0009-9_CR25","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1007\/s10107-005-0663-7","article-title":"Approximate extended formulations","volume":"105","author":"Van Vyve","year":"2006","journal-title":"Math Program"},{"key":"10.1007\/s13675-013-0009-9_CR26","unstructured":"Vanderbeck F (2008) Bapcod\u2014a branch-and-price generic code. University of Bordeaux, INRIA Research team ReAlOpt."},{"issue":"3","key":"10.1007\/s13675-013-0009-9_CR27","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/j.orl.2005.05.009","article-title":"A generic view of Dantzig-Wolfe decomposition in mixed integer programming","volume":"34","author":"Vanderbeck","year":"2006","journal-title":"Oper Res Lett"},{"key":"10.1007\/s13675-013-0009-9_CR28","doi-asserted-by":"crossref","unstructured":"Vanderbeck F, Wolsey LA (2010) Reformulation and decomposition of integer programs. In: J\u00fcnger M, Liebling TM, Naddef D, Nemhauser GL, Pulleyblank WR, Reinelt G, Rinaldi G, Wolsey LA (eds) 50 Years of integer programming 1958\u20132008. Springer, Berlin\/Heidelberg, pp 431\u2013502","DOI":"10.1007\/978-3-540-68279-0_13"},{"issue":"2","key":"10.1007\/s13675-013-0009-9_CR29","first-page":"151","article-title":"Weighted Dantzig-Wolfe decomposition for linear mixed-integer programming","volume":"4","author":"Wentges","year":"1997","journal-title":"Int Trans Oper Res"}],"container-title":["EURO Journal on Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0009-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s13675-013-0009-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000137?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2192440621000137?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s13675-013-0009-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T03:45:59Z","timestamp":1761882359000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2192440621000137"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,5]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["S2192440621000137"],"URL":"https:\/\/doi.org\/10.1007\/s13675-013-0009-9","relation":{},"ISSN":["2192-4406"],"issn-type":[{"value":"2192-4406","type":"print"}],"subject":[],"published":{"date-parts":[[2013,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Column generation for extended formulations","name":"articletitle","label":"Article Title"},{"value":"EURO Journal on Computational Optimization","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1007\/s13675-013-0009-9","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2013 The Author(s). Published by Elsevier B.V. on behalf of Association of European Operational Research Societies (EURO). Published by Elsevier Ltd All rights reserved.","name":"copyright","label":"Copyright"}]}}