{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,16]],"date-time":"2024-09-16T21:31:26Z","timestamp":1726522286131},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0377-2217(02)00125-x","type":"journal-article","created":{"date-parts":[[2002,10,10]],"date-time":"2002-10-10T15:46:28Z","timestamp":1034264788000},"page":"274-294","source":"Crossref","is-referenced-by-count":90,"title":["A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths"],"prefix":"10.1016","volume":"141","author":[{"given":"G.","family":"Belov","sequence":"first","affiliation":[]},{"given":"G.","family":"Scheithauer","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(02)00125-X_BIB1","unstructured":"G. Belov, Das eindimensionale Zuschnittproblem mit mehreren Ausgangsl\u00e4ngen, Diplomarbeit, Technische Universit\u00e4t Dresden, 2000"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB2","unstructured":"Z. Degraeve, M. Peeters, Optimal integer solutions to industrial cutting stock problems: Part 2, Benchmark results, Technical Report, Katholieke Universiteit Leuven, 2000"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB3","series-title":"Annotated Bibliographies in Combinatorial Optimization","first-page":"393","article-title":"Cutting and packing","author":"Dyckhoff","year":"1997"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB4","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":"Operations Research"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB5","unstructured":"J. Kupke, L\u00f6sung von ganzzahligen Verschnittproblemen mit branch-and-price, Diplomarbeit, Universit\u00e4t zu K\u00f6ln, 1998"},{"issue":"5","key":"10.1016\/S0377-2217(02)00125-X_BIB6","first-page":"239","article-title":"An instance of the cutting stock problem for which the rounding property does not hold","volume":"4","author":"Marcotte","year":"1986","journal-title":"OR Letters"},{"year":"1990","series-title":"Knapsack Problems \u2013 Algorithms and Computer Implementations","author":"Martello","key":"10.1016\/S0377-2217(02)00125-X_BIB7"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB8","unstructured":"E.A. Mukhacheva, Multi-variant pattern for cutting stock generation, in: Optimal Stock Cutting-2, All-Union Conference Papers, Ufa, 1981"},{"issue":"2","key":"10.1016\/S0377-2217(02)00125-X_BIB9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1590\/S0101-74382000000200002","article-title":"One-dimensional cutting stock problem: Numerical experiments with the sequential value correction method and a modified branch-and-bound method","volume":"20","author":"Mukhacheva","year":"2000","journal-title":"Pesquisa Operacional"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB10","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1093\/comjnl\/9.3.275","article-title":"Finding the shortest route between two points in a network","volume":"9","author":"Nicholson","year":"1966","journal-title":"Computer Journal"},{"year":"1988","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","key":"10.1016\/S0377-2217(02)00125-X_BIB11"},{"issue":"3","key":"10.1016\/S0377-2217(02)00125-X_BIB12","doi-asserted-by":"crossref","first-page":"654","DOI":"10.1016\/S0377-2217(97)00404-9","article-title":"Tighter relaxations for the cutting stock problem","volume":"112","author":"Nitsche","year":"1999","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"10.1016\/S0377-2217(02)00125-X_BIB13","doi-asserted-by":"crossref","first-page":"562","DOI":"10.1016\/0377-2217(95)00022-I","article-title":"The modified integer round-up property of the one-dimensional cutting stock problem","volume":"84","author":"Scheithauer","year":"1995","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"10.1016\/S0377-2217(02)00125-X_BIB14","first-page":"151","article-title":"A branch-and-bound algorithm for solving one-dimensional cutting stock problems exactly","volume":"23","author":"Scheithauer","year":"1995","journal-title":"Applicationes Mathematicae"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB15","doi-asserted-by":"crossref","unstructured":"G. Scheithauer, J. Terno, A. M\u00fcller, G. Belov, Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm, Journal of the Operational Research Society 52 (2001) 1390\u20131401","DOI":"10.1057\/palgrave.jors.2601242"},{"issue":"2","key":"10.1016\/S0377-2217(02)00125-X_BIB16","first-page":"111","article-title":"A new lower bound for the bin-packing problem and its integration to MTP","volume":"19","author":"Schwerin","year":"1999","journal-title":"Pesquisa Operacional"},{"key":"10.1016\/S0377-2217(02)00125-X_BIB17","unstructured":"J. Terno, R. Lindemann, G. Scheithauer, Zuschnittprobleme und ihre praktische L\u00f6sung, Verlag Harri Deutsch Thun und Frankfurt\/Main, 1987"},{"issue":"3","key":"10.1016\/S0377-2217(02)00125-X_BIB18","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1023\/A:1018346107246","article-title":"Branch-and-price algorithms for the one-dimensional cutting stock problem","volume":"9","author":"Vance","year":"1998","journal-title":"Computational Optimization and Applications"},{"issue":"Ser. A","key":"10.1016\/S0377-2217(02)00125-X_BIB19","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1007\/s101070050105","article-title":"Computational study of a column generation algorithm for bin packing and cutting stock problems","volume":"86","author":"Vanderbeck","year":"1999","journal-title":"Mathematical Programming"},{"issue":"3","key":"10.1016\/S0377-2217(02)00125-X_BIB20","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF01539705","article-title":"Heuristics for the one-dimensional cutting stock problem: A computational study","volume":"18","author":"W\u00e4scher","year":"1996","journal-title":"OR Spektrum"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200125X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S037722170200125X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T11:25:37Z","timestamp":1556709937000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S037722170200125X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S037722170200125X"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(02)00125-x","relation":{},"ISSN":["0377-2217"],"issn-type":[{"type":"print","value":"0377-2217"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}