{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T09:52:24Z","timestamp":1762509144608},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T00:00:00Z","timestamp":1722988800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To solve a linear programming problem with many variables and constraints, a simultaneous column and row generation algorithm can be used. Such an algorithm iteratively solves a restricted version of a linear programming problem including only a subset of the variables and constraints. In each iteration, it might simultaneously add both a new variable and constraint, as opposed to non-simultaneous column and row generation algorithms that only add either a new variable or constraint. In this paper, a simple perspective is provided to indicate the relevance of simultaneous column and row generation and to make it more accessible. Particular emphasis is put on an optimality condition for linear programming which is perhaps a particular source of confusion in this context. It is argued that optimality can be achieved using non-simultaneous column and row generation algorithms, while an example is provided illustrating the potential computational gains of using simultaneous column and row generation algorithms.<\/jats:p>","DOI":"10.1007\/s43069-024-00348-2","type":"journal-article","created":{"date-parts":[[2024,8,7]],"date-time":"2024-08-07T11:04:08Z","timestamp":1723028648000},"update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Simple Perspective on Simultaneous Column and\u00a0Row Generation"],"prefix":"10.1007","volume":"5","author":[{"given":"Remy","family":"Spliet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,8,7]]},"reference":[{"key":"348_CR1","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.orl.2010.06.002","volume":"38","author":"D Feillet","year":"2010","unstructured":"Feillet D, Gendreau M, Medaglia AL, Walteros JL (2010) A note on branch-and-cut-and-price. Oper Res Lett 38:346\u2013353","journal-title":"Oper Res Lett"},{"key":"348_CR2","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1016\/j.ejor.2017.06.044","volume":"264","author":"I Muter","year":"2018","unstructured":"Muter I, Birbil \u015eI, B\u00fclb\u00fcl K (2018) Benders decomposition and column-and-row generation for solving large-scale linear programs with column dependent rows. Eur J Oper Res 264:29\u201345","journal-title":"Eur J Oper Res"},{"key":"348_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/s10107-012-0561-8","volume":"142","author":"I Muter","year":"2013","unstructured":"Muter I, Birbil \u015eI, B\u00fclb\u00fcl K (2013) Simultaneous column-and-row generation for large scale linear programs with column-dependent-rows. Math Program 142:47\u201382","journal-title":"Math Program"},{"key":"348_CR4","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1016\/j.ejor.2004.09.055","volume":"173","author":"P Avella","year":"2006","unstructured":"Avella P, D\u2019Auria B, Salerno S (2006) A LP-based heuristic for a time-constrained routing problem. Eur J Oper Res 173:120\u2013124","journal-title":"Eur J Oper Res"},{"key":"348_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/j.ejor.2012.03.048","volume":"221","author":"I Muter","year":"2012","unstructured":"Muter I, Birbil \u015eI, B\u00fclb\u00fcl K, \u015eahin G (2012) A note on A LP-based heuristic for a time-constrained routing problem. Eur J Oper Res 221:306\u2013307","journal-title":"Eur J Oper Res"},{"key":"348_CR6","doi-asserted-by":"crossref","unstructured":"Desrosiers J, L\u00fcbbecke ME (2010) Branch-price-and-cut algorithms. Wiley encyclopedia of operations research and management","DOI":"10.1002\/9780470400531.eorms0118"},{"key":"348_CR7","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/s13675-013-0009-9","volume":"1","author":"R Sadykov","year":"2013","unstructured":"Sadykov R, Vanderbeck F (2013) Column generation for extended formulations. EURO J Comput Opt 1:81\u2013115","journal-title":"EURO J Comput Opt"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00348-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-024-00348-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-024-00348-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,10]],"date-time":"2024-10-10T13:09:14Z","timestamp":1728565754000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-024-00348-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,7]]},"references-count":7,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2024,9]]}},"alternative-id":["348"],"URL":"https:\/\/doi.org\/10.1007\/s43069-024-00348-2","relation":{},"ISSN":["2662-2556"],"issn-type":[{"type":"electronic","value":"2662-2556"}],"subject":[],"published":{"date-parts":[[2024,8,7]]},"assertion":[{"value":"13 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 August 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"The author declares no competing interests.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}}],"article-number":"69"}}