{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,24]],"date-time":"2026-06-24T15:08:23Z","timestamp":1782313703446,"version":"3.54.5"},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1996,10]]},"DOI":"10.1016\/0167-6377(96)00033-8","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T22:21:32Z","timestamp":1052778092000},"page":"151-159","source":"Crossref","is-referenced-by-count":164,"title":["An exact algorithm for IP column generation"],"prefix":"10.1016","volume":"19","author":[{"given":"Fran\u00e7ois","family":"Vanderbeck","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurence A.","family":"Wolsey","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(96)00033-8_BIB1","article-title":"Branch and price: Column generation for solving huge integer programs","author":"Barnhart","year":"1994"},{"key":"10.1016\/0167-6377(96)00033-8_BIB2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","article-title":"Decomposition principle for linear programs","volume":"8","author":"Dantzig","year":"1960","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(96)00033-8_BIB3","article-title":"Time constrained routing and scheduling","author":"Desrosiers","year":"1990"},{"key":"10.1016\/0167-6377(96)00033-8_BIB4","doi-asserted-by":"crossref","first-page":"922","DOI":"10.1287\/opre.38.5.922","article-title":"A note on bounding a class of linear programming problems, including cutting stock problems","volume":"38","author":"Farley","year":"1990","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(96)00033-8_BIB5","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","article-title":"A linear programming approach to the cutting stock problem","volume":"9","author":"Gilmore","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(96)00033-8_BIB6","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","article-title":"A linear programming approach to the cutting stock problem: Part II","volume":"11","author":"Gilmore","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(96)00033-8_BIB7","series-title":"Proc. IPCO2","first-page":"165","article-title":"Mixed integer column generation and the probabilistic maximum satisfiability problem","author":"Hansen","year":"1992"},{"key":"10.1016\/0167-6377(96)00033-8_BIB8","unstructured":"C. Hurkens, private communication, 1995."},{"key":"10.1016\/0167-6377(96)00033-8_BIB9","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01585164","article-title":"Min-cut clustering","volume":"62","author":"Johnson","year":"1993","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(96)00033-8_BIB10","series-title":"Optimization Theory for Large Systems","author":"Lasdan","year":"1970"},{"key":"10.1016\/0167-6377(96)00033-8_BIB11","article-title":"Optimal trees","volume":"Vol. 7","author":"Magnanti","year":"1995"},{"key":"10.1016\/0167-6377(96)00033-8_BIB12","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1051\/ro\/1987210201051","article-title":"A class of combinatorial optimization problems with polynomially solvable large scale set-covering\/partitioning relaxations","volume":"21","author":"Minoux","year":"1987","journal-title":"RAIRO"},{"key":"10.1016\/0167-6377(96)00033-8_BIB13","series-title":"Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling","first-page":"269","article-title":"An integer programming approach to scheduling","author":"Ryan","year":"1981"},{"key":"10.1016\/0167-6377(96)00033-8_BIB14","article-title":"A branch and price algorithm for the generalized assignment problem","author":"Savelsbergh","year":"1993"},{"key":"10.1016\/0167-6377(96)00033-8_BIB15","article-title":"Optimal placement of add\/drop multiplexers: Heuristic and exact algorithms","author":"Sutter","year":"1994"},{"key":"10.1016\/0167-6377(96)00033-8_BIB16","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01300970","article-title":"Solving binary cutting stock problems by column generation and branch-and-bound","volume":"3","author":"Vance","year":"1994","journal-title":"Comput. Optim. Appl."},{"key":"10.1016\/0167-6377(96)00033-8_BIB17","article-title":"Decomposition and column generation for integer programs","author":"Vanderbeck","year":"1994"},{"key":"10.1016\/0167-6377(96)00033-8_BIB18","article-title":"On integer programming decomposition and ways to enforce integrality in the master","author":"Vanderbeck","year":"1995"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637796000338?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167637796000338?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T04:53:49Z","timestamp":1555563229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167637796000338"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0167637796000338"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(96)00033-8","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}