{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T06:08:01Z","timestamp":1775887681093,"version":"3.50.1"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":5038,"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":[[1999,10]]},"DOI":"10.1016\/s0166-218x(99)00112-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T14:55:55Z","timestamp":1027608955000},"page":"121-130","source":"Crossref","is-referenced-by-count":37,"title":["Pattern minimisation in cutting stock problems"],"prefix":"10.1016","volume":"98","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(99)00112-2_BIB1","unstructured":"C. Aldridge, J. Chapman, R. Gower, R. Leese, C. McDiarmid, M. Shepherd, H. Tuenter, H. Wilson, A. Zinober, Pattern Reduction in Paper Cutting, Report of the 29th European Study Group with Industry, University of Oxford, March 1996."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB2","unstructured":"J.M. Allwood, C.N. Goulimis, Reducing the number of patterns in the 1-dimensional cutting stock problem, Internal Report of Control Section, Electrical Engineering Department, Imperial College, 1988."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1002\/rsa.3240030308","article-title":"Simple constructions of almost k-wise independent random variables","volume":"3","author":"Alon","year":"1992","journal-title":"Random Structures and Algorithms"},{"key":"10.1016\/S0166-218X(99)00112-2_BIB4","unstructured":"V. Chv\u00e1tal, Linear Programming, Freeman, San Francisco, 1983, pp. 195\u2013212."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB5","unstructured":"E.G. Coffman, G.S. Lueker, Probabilistic Analysis of Packing and Partitioning Algorithms, Wiley, New York, 1991."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB6","unstructured":"M.R. Garey, D.S. Johnson, Computers and Intractability, Freeman, San Francisco, 1979."},{"key":"10.1016\/S0166-218X(99)00112-2_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","volume":"9","author":"Gilmore","year":"1961","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB8","doi-asserted-by":"crossref","first-page":"863","DOI":"10.1287\/opre.11.6.863","article-title":"A linear programming approach to the cutting-stock probelem \u2013 Part II","volume":"11","author":"Gilmore","year":"1963","journal-title":"Oper. Res."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB9","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0377-2217(90)90355-F","article-title":"Optimal solutions for the cutting stock problem","volume":"44","author":"Goulimis","year":"1990","journal-title":"European J. Oper. Res."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB10","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","article-title":"The NP-completeness column: an ongoing guide","volume":"3","author":"Johnson","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/S0166-218X(99)00112-2_BIB11","first-page":"166","article-title":"Rounding algorithms for cutting stock problems","volume":"3","author":"Johnston","year":"1986","journal-title":"J. Asian\u2013Pacific Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB12","unstructured":"N. Karmarkar, R.M. Karp, The differencing method of set partitioning, Technical Report UCB\/CSD 82\/113, Computer Science Division (EECS), University of California, Berkeley, 1982."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB13","doi-asserted-by":"crossref","unstructured":"A. Shamir, On the cryptocomplexity of knapsack systems, Proc. 11th Ann. ACM Symp. on Theory of Computing, 1979, pp. 118\u2013129.","DOI":"10.1145\/800135.804405"},{"key":"10.1016\/S0166-218X(99)00112-2_BIB14","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1057\/jors.1992.101","article-title":"Cutting and packing problems: a categorized, application-orientated research bibliography","volume":"43","author":"Sweeney","year":"1992","journal-title":"J. Oper. Res. Soc."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB15","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/0166-218X(94)00032-9","article-title":"The modified differencing method for the set partitioning problem with cardinality conditions","volume":"63","author":"Tsai","year":"1995","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB16","unstructured":"H. Tuenter, Personal communication, 1996."},{"key":"10.1016\/S0166-218X(99)00112-2_BIB17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1287\/moor.21.1.85","article-title":"The differencing algorithm LDM for partitioning: a proof of a conjecture of Karmarkar and Karp","volume":"21","author":"Yakir","year":"1996","journal-title":"Math. Oper. Res."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001122?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X99001122?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T20:30:30Z","timestamp":1556397030000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X99001122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["S0166218X99001122"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(99)00112-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}