{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T16:02:04Z","timestamp":1774368124770,"version":"3.50.1"},"reference-count":20,"publisher":"Elsevier BV","issue":"1-3","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\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3972,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1016\/s0166-218x(01)00361-4","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T15:12:20Z","timestamp":1034608340000},"page":"229-245","source":"Crossref","is-referenced-by-count":21,"title":["Families of non-IRUP instances of the one-dimensional cutting stock problem"],"prefix":"10.1016","volume":"121","author":[{"given":"J\u00fcrgen","family":"Rietz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guntram","family":"Scheithauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Johannes","family":"Terno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(01)00361-4_BIB1","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0602044","article-title":"Integer rounding for polymatroid and branching optimization problems","volume":"2","author":"Baum","year":"1981","journal-title":"SIAM J. Algebraic Discrete Methods"},{"key":"10.1016\/S0166-218X(01)00361-4_BIB2","first-page":"287","article-title":"A column generation algorithm to schedule identical parallel machines","volume":"6","author":"Demir","year":"1995","journal-title":"Pure Math. Appl."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB3","unstructured":"H. Dyckhoff, G. Scheithauer, J. Terno, Cutting and packing, in: M. Dell'Amico, F. Maffioli, S. Martello (Eds.), Annotated Bibliographies in Combinatorial Optimization, Wiley, Chichester, 1997, pp. 393\u2013412."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB4","unstructured":"M. Fieldhouse, The duality gap in trim problems, SICUP-Bulletin (1990) 5."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB5","series-title":"Computer and Intactability\u2014A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(01)00361-4_BIB6","unstructured":"T. Gau, Quasi-exact and heuristic algorithms for the standard one-dimensional cutting-stock problem, Working Paper, Techn. Univ. Braunschweig, D, 1994."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB7","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 (Part I)","volume":"9","author":"Gilmore","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB8","doi-asserted-by":"crossref","first-page":"648","DOI":"10.1287\/opre.39.4.648","article-title":"Strongly polynomial algorithms for the high multiplicity scheduling problem","volume":"39","author":"Hochbaum","year":"1991","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB9","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 Lett."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB10","series-title":"Knapsack Problems\u2014Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0166-218X(01)00361-4_BIB11","unstructured":"V. Nica, General counterexample to the integer round-up property, Technical report, Bucharest, RO, 1994."},{"key":"10.1016\/S0166-218X(01)00361-4_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 J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB13","unstructured":"J. Rietz, J. Terno, A new 1CSP heuristic, Paper presented at EURO XVI Conference, Brussels, 1998."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB14","doi-asserted-by":"crossref","unstructured":"G. Scheithauer, J. Terno, About the gap between the optimal values of the integer and continuous relaxation one-dimensional cutting stock problem, in: Operations Research Proceedings, Springer, Berlin, Heidelberg, 1992, pp. 439\u2013444.","DOI":"10.1007\/978-3-642-46773-8_111"},{"key":"10.1016\/S0166-218X(01)00361-4_BIB15","first-page":"151","article-title":"A branch-and-bound algorithm for solving 1D cutting stock problems exactly","volume":"23","author":"Scheithauer","year":"1995","journal-title":"Appl. Math."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB16","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 J. Oper. Res."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB17","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1016\/S0167-6377(96)00047-8","article-title":"Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem","volume":"20","author":"Scheithauer","year":"1997","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/S0166-218X(01)00361-4_BIB18","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, J. Oper. Res. Soc. (2001), 1390\u20131401.","DOI":"10.1057\/palgrave.jors.2601242"},{"key":"10.1016\/S0166-218X(01)00361-4_BIB19","doi-asserted-by":"crossref","unstructured":"F. Vanderbeck, Computational study of a column generation algorithm for bin packing and cutting stock problems, Working Paper, University of Cambridge, UK, 1998.","DOI":"10.1007\/s101070050105"},{"key":"10.1016\/S0166-218X(01)00361-4_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":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003614?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X01003614?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,8]],"date-time":"2023-04-08T12:20:50Z","timestamp":1680956450000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X01003614"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":20,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["S0166218X01003614"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(01)00361-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}