{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:26:33Z","timestamp":1759847193611,"version":"3.40.5"},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,11,1]],"date-time":"2001-11-01T00:00:00Z","timestamp":1004572800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Annals of Operations Research"],"published-print":{"date-parts":[[2001,11]]},"DOI":"10.1023\/a:1016059012379","type":"journal-article","created":{"date-parts":[[2002,12,29]],"date-time":"2002-12-29T01:59:24Z","timestamp":1041127164000},"page":"143-156","source":"Crossref","is-referenced-by-count":3,"title":["A Column Generation Approach to Delivery Planning over Time with Inhomogeneous Service Providers and Service Interval Constraints"],"prefix":"10.1007","volume":"108","author":[{"given":"N.","family":"Boland","sequence":"first","affiliation":[]},{"given":"T.","family":"Surendonk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"5087904_CR1","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1287\/trsc.32.3.208","volume":"32","author":"C. Barnhart","year":"1998","unstructured":"C. Barnhart, N. Boland, L. Clarke, E.L. Johnson, G.L. Nemhauser and R.G. Shenoi, Flight string models for aircraft fleeting and routing, Transportation Science 32 (1998) 208\u2013220.","journal-title":"Transportation Science"},{"key":"5087904_CR2","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/S0305-0548(98)00071-9","volume":"26","author":"S.E. Butt","year":"1999","unstructured":"S.E. Butt and D.M. Ryan, An optimal solution procedure for the multiple tour maximum collection problem using column generation, Computers and Operations Research 26 (1999) 427\u2013441.","journal-title":"Computers and Operations Research"},{"key":"5087904_CR3","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0377-2217(94)90122-8","volume":"78","author":"Y. Crama","year":"1994","unstructured":"Y. Crama and A.G. Oerlemans, A column generation approach to job grouping for flexible manufacturing systems, European Journal of Operational Research 78 (1994) 58\u201380.","journal-title":"European Journal of Operational Research"},{"key":"5087904_CR4","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"G.B. Dantzig and P. Wolfe, Decomposition principle for linear programs, Operations Research 8 (1960) 101\u2013111.","journal-title":"Operations Research"},{"key":"5087904_CR5","doi-asserted-by":"crossref","first-page":"649","DOI":"10.1287\/opre.45.5.649","volume":"45","author":"P.R. Day","year":"1997","unstructured":"P.R. Day and D.M. Ryan, Flight attendant rostering for short-haul airline operations, Operations Research 45 (1997) 649\u2013661.","journal-title":"Operations Research"},{"key":"5087904_CR6","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1016\/S0377-2217(96)00195-6","volume":"97","author":"G. Desaulniers","year":"1997","unstructured":"G. Desaulniers, J. Desrosiers, Y. Dumas, S. Marc, B. Rioux, M.M. Solomon and F. Soumis, Crew pairing at Air France, European Journal of Operational Research 97 (1997) 245\u2013259.","journal-title":"European Journal of Operational Research"},{"key":"5087904_CR7","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers and M. Solomon, A new optimization algorithm for the vehicle routing problem with time windows, Operations Research 40 (1992) 342\u2013354.","journal-title":"Operations Research"},{"key":"5087904_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.23.1.1","volume":"23","author":"M. Desrochers","year":"1989","unstructured":"M. Desrochers and F. Soumis, A column generation approach to the urban transit crew scheduling problem, Transportation Science 23 (1989) 1\u201313.","journal-title":"Transportation Science"},{"key":"5087904_CR9","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1080\/00207549608904905","volume":"34","author":"Y. Fathi","year":"1996","unstructured":"Y. Fathi, S.R. Kegler and C.T. Culbreth, A column generation procedure for gang-rip saw arbor design and scheduling, International Journal of Production Research 34 (1996) 313\u2013327.","journal-title":"International Journal of Production Research"},{"key":"5087904_CR10","unstructured":"R. Fourer, D.M. Gay and B.W. Kernighan, AMPL: A Modeling Languarge for Mathematical Programming (Boyd and Fraser, 1993)."},{"key":"5087904_CR11","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1287\/opre.9.6.849","volume":"9","author":"P.C. Gilmore","year":"1961","unstructured":"P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem, Operations Research 9 (1961) 849\u2013859.","journal-title":"Operations Research"},{"key":"5087904_CR12","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","volume":"11","author":"P.C. Gilmore","year":"1961","unstructured":"P.C. Gilmore and R.E. Gomory, A linear programming approach to the cutting stock problem: Part II, Operations Research 11 (1961) 863\u2013888.","journal-title":"Operations Research"},{"key":"5087904_CR13","unstructured":"Ilog Inc., Ilog Cplex 6.5 Reference Manual."},{"key":"5087904_CR14","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.45.3.395","volume":"45","author":"N. Kohl","year":"1997","unstructured":"N. Kohl and O.B.G. Madsen, An optimization algorithm for the vehicle routing problem with time windows based on Lagrangean relaxation, Operations Research 45 (1997) 395\u2013406.","journal-title":"Operations Research"},{"key":"5087904_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0377-2217(88)90377-3","volume":"35","author":"S. Lavoie","year":"1988","unstructured":"S. Lavoie, M. Minoux and E. Odier, A new approach for crew pairing problems by column generation with an application to air transportation, European Journal of Operational Research 35 (1988) 45\u201358.","journal-title":"European Journal of Operational Research"},{"key":"5087904_CR16","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0167-6377(94)90013-2","volume":"15","author":"G.L. Nemhauser","year":"1994","unstructured":"G.L. Nemhauser, M.W.P. Savelsbergh and G.S. Sigismondi, MINTO, a Mixed INTeger Optimizer, Operations Research Letters 15 (1994) 47\u201358.","journal-title":"Operations Research Letters"},{"key":"5087904_CR17","doi-asserted-by":"crossref","unstructured":"G. Nemhauser and L. Wolsey, Integer and Combinatorial Optimization (Wiley, 1988).","DOI":"10.1002\/9781118627372"},{"key":"5087904_CR18","unstructured":"F. Soumis, Decomposition and column generation, GERAD Research Report G-97-42 (1997)."},{"key":"5087904_CR19","doi-asserted-by":"crossref","first-page":"580","DOI":"10.1016\/0377-2217(95)00024-K","volume":"84","author":"J.M. Val\u00e9rio de Carvalho","year":"1995","unstructured":"J.M. Val\u00e9rio de Carvalho and A.J. Guimaraes Rodrigues, An LP-based approach to a two-stage cutting stock problem, European Journal of Operational Research 84 (1995) 580\u2013589.","journal-title":"European Journal of Operational Research"},{"key":"5087904_CR20","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1007\/BF01300970","volume":"3","author":"P.H. Vance","year":"1994","unstructured":"P.H. Vance, C. Barnhart, E.L. Johnson and G.L. Nemhauser, Solving binary cutting stock problems by column generation and branch-and-bound, Computational Optimization and Applications 3 (1994) 111\u2013130.","journal-title":"Computational Optimization and Applications"},{"key":"5087904_CR21","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1018346107246","volume":"9","author":"P.H. Vance","year":"1998","unstructured":"P.H. Vance, Branch-and-price algorithms for the one-dimensional cutting stock problem, Computational Optimization and Applications 9 (1998) 211\u2013228.","journal-title":"Computational Optimization and Applications"},{"key":"5087904_CR22","unstructured":"M. van den Akker, LP-based solution methods for single-machine scheduling problems, Ph.D. Thesis, Technische Universiteit Eindhoven (1994)."},{"key":"5087904_CR23","unstructured":"F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, University of Cambridge, Research Papers in Management Studies 14 (1996)."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016059012379.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1016059012379\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1016059012379.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:21:20Z","timestamp":1747578080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1016059012379"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,11]]},"references-count":23,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2001,11]]}},"alternative-id":["5087904"],"URL":"https:\/\/doi.org\/10.1023\/a:1016059012379","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2001,11]]}}}