{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:37:28Z","timestamp":1767987448817,"version":"3.49.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"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":[[1999,4]]},"DOI":"10.1016\/s0377-2217(98)00163-5","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:48:22Z","timestamp":1027619302000},"page":"395-402","source":"Crossref","is-referenced-by-count":12,"title":["The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming"],"prefix":"10.1016","volume":"114","author":[{"given":"Julien","family":"Antonio","sequence":"first","affiliation":[]},{"given":"Fabrice","family":"Chauvet","sequence":"additional","affiliation":[]},{"given":"Chengbin","family":"Chu","sequence":"additional","affiliation":[]},{"given":"Jean-Marie","family":"Proth","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00163-5_BIB1","doi-asserted-by":"crossref","unstructured":"E.G. Coffman Jr., M.R. Garey, D.S. Johnson, Approximation Algorithms for Bin-Packing \u2013 An Updated Survey, Bell Laboratories, Murray Hill, NJ, 1984","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"10.1016\/S0377-2217(98)00163-5_BIB2","doi-asserted-by":"crossref","unstructured":"M.R. Garey, D.S. Johnson, Approximation algorithms for bin packing problems: A survey, in: G. Ausiello, M. Lucertini (Eds.), Analysis and Design of Algorithms in Combinatorial Optimisation, Springer, Berlin, 1981, pp. 149\u2013172","DOI":"10.1007\/978-3-7091-2748-3_8"},{"key":"10.1016\/S0377-2217(98)00163-5_BIB3","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1016\/S0022-0000(74)80026-7","article-title":"Fast algorithms for bin packing","volume":"8","author":"Johnson","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0377-2217(98)00163-5_BIB4","doi-asserted-by":"crossref","unstructured":"J. Antonio, C. Chu, N. Sauer, P. Wolff, POEM project and solution for one-dimensional multi-criteria cutting stock problems, in: Operations Research Proceedings (SOR'95), Passeau, GE, 1995","DOI":"10.1007\/978-3-642-80117-4_8"},{"issue":"1","key":"10.1016\/S0377-2217(98)00163-5_BIB5","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0377-2217(92)90288-K","article-title":"Packing problems","volume":"56","author":"Dowsland","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00163-5_BIB6","doi-asserted-by":"crossref","first-page":"1092","DOI":"10.1287\/opre.29.6.1092","article-title":"A new linear programming approach to the cutting stock problem","volume":"29","author":"Dyckhoff","year":"1981","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0377-2217(98)00163-5_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/0377-2217(90)90350-K","article-title":"A typology of cutting and packing problems","volume":"44","author":"Dyckhoff","year":"1990","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(98)00163-5_BIB8","doi-asserted-by":"crossref","unstructured":"H. Dyckhoff, U. Finke, Cutting and Packing in Production and Distribution: A Typology and Bibliography, Physica, Aachen, GE, 1992","DOI":"10.1007\/978-3-642-58165-6_5"},{"key":"10.1016\/S0377-2217(98)00163-5_BIB9","doi-asserted-by":"crossref","unstructured":"P.C. Gilmore, R.E. Gomory, Linear programming approach to the cutting-stock problem, Operations Research 9 (1961)","DOI":"10.1287\/opre.9.6.849"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001635?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798001635?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,14]],"date-time":"2020-01-14T18:02:59Z","timestamp":1579024979000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798001635"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":9,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0377221798001635"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00163-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}