{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,28]],"date-time":"2023-01-28T12:56:14Z","timestamp":1674910574358},"reference-count":35,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,11,1]],"date-time":"1987-11-01T00:00:00Z","timestamp":562723200000},"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":9390,"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":[[1987,11]]},"DOI":"10.1016\/0166-218x(87)90024-2","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:43:01Z","timestamp":1027640581000},"page":"235-245","source":"Crossref","is-referenced-by-count":14,"title":["A new enumeration scheme for the knapsack problem"],"prefix":"10.1016","volume":"18","author":[{"given":"Horacio Hideki","family":"Yanasse","sequence":"first","affiliation":[]},{"given":"Nei Yoshihiro","family":"Soma","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(87)90024-2_BIB1","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1287\/opre.23.6.1099","article-title":"Merging and sorting applied to the zero\u2013one knapsack problem","volume":"23","author":"Ahrens","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero-one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1002\/nav.3800260105","article-title":"Computational results with a branch-and-bound algorithm for the general knapsack problem","volume":"26","author":"Bulfin","year":"1979","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(87)90024-2_BIB4","doi-asserted-by":"crossref","first-page":"1402","DOI":"10.1287\/opre.28.6.1402","article-title":"Hard knapsack problems","volume":"28","author":"Chv\u00e1tal","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB5","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.5.2.266","article-title":"Discrete extremum problems","volume":"5","author":"Dantzig","year":"1957","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB6","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1287\/opre.27.3.548","article-title":"Shortest-route methods: 2. Goup knapsack, expanded networks, and branch-and-bound","volume":"27","author":"Denardo","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB7","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1287\/opre.21.1.332","article-title":"Solution of the value-independent knapsack problem by partitioning","volume":"21","author":"Faaland","year":"1973","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB8","doi-asserted-by":"crossref","first-page":"272","DOI":"10.1007\/BF01580448","article-title":"Resolution of the 0\u20131 knapsack problem: comparison of methods","volume":"8","author":"Fayard","year":"1975","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(87)90024-2_BIB9","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/BF02241754","article-title":"An algorithm for the solution of the 0\u20131 knapsack problem","volume":"28","author":"Fayard","year":"1982","journal-title":"Computing"},{"key":"10.1016\/0166-218X(87)90024-2_BIB10","series-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(87)90024-2_BIB11","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 II","volume":"11","author":"Gilmore","year":"1963","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB12","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1287\/opre.13.1.94","article-title":"Multistage cutting stock problems of two and more dimensions","volume":"13","author":"Gilmore","year":"1965","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB13","doi-asserted-by":"crossref","first-page":"1045","DOI":"10.1287\/opre.14.6.1045","article-title":"The theory and computation of knapsack functions","volume":"14","author":"Gilmore","year":"1966","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB14","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","article-title":"Bounds on multiprocessing timing anomalies","volume":"17","author":"Graham","year":"1969","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(87)90024-2_BIB15","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0022-247X(69)90185-1","article-title":"An algorithm for the computation of knapsack functions","volume":"26","author":"Greenberg","year":"1969","journal-title":"J. Math. Anal. Appl."},{"key":"10.1016\/0166-218X(87)90024-2_BIB16","series-title":"Elementary Theory of Numbers","author":"Griffin","year":"1954"},{"key":"10.1016\/0166-218X(87)90024-2_BIB17","series-title":"Operations Research \u2014 An Introduction to Linear Optimization and Decision Analysis","author":"Harvey","year":"1979"},{"key":"10.1016\/0166-218X(87)90024-2_BIB18","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(87)90024-2_BIB19","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(87)90024-2_BIB20","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1145\/322358.322368","article-title":"Polynomial-time aggregation of integer programming problems","volume":"30","author":"Kannan","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(87)90024-2_BIB21","first-page":"127","article-title":"The knapsack problem: a survey","volume":"2","author":"Kluyver","year":"1975","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0166-218X(87)90024-2_BIB22","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximations algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(87)90024-2_BIB23","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1086\/294081","article-title":"Three problems in capital rationing","volume":"28","author":"Lorie","year":"1955","journal-title":"J. Business"},{"key":"10.1016\/0166-218X(87)90024-2_BIB24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","article-title":"An upper bound for the zero\u2013one knapsack problem and branch-and-bound algorithm","volume":"1","author":"Martello","year":"1977","journal-title":"Europ. J. Oper. Res."},{"key":"10.1016\/0166-218X(87)90024-2_BIB25","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02252196","article-title":"Algorithm for the solution of the 0\u20131 single knapsack problem","volume":"21","author":"Martello","year":"1978","journal-title":"Computing"},{"key":"10.1016\/0166-218X(87)90024-2_BIB26","series-title":"Combinatorial Optimization","article-title":"The 0\u20131 knapsack problem","author":"Martello","year":"1979"},{"key":"10.1016\/0166-218X(87)90024-2_BIB27","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1007\/BF02612360","article-title":"Worst-case analysis of greedy algorithms for the subset-sum problem","volume":"28","author":"Martello","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(87)90024-2_BIB28","first-page":"173","article-title":"Sulla equazione lineare intermediata","volume":"23","author":"Mignosi","year":"1908","journal-title":"Periodico di Matematica"},{"key":"10.1016\/0166-218X(87)90024-2_BIB29","doi-asserted-by":"crossref","first-page":"795","DOI":"10.1287\/opre.31.4.795","article-title":"Computational viability of a constraint aggregation scheme for integer linear programming problems","volume":"31","author":"Onyekwelu","year":"1983","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB30","first-page":"277","article-title":"A hybrid method for the 0\u20131 knapsack problem","volume":"49","author":"Plateau","year":"1985","journal-title":"Methods of Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB31","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/321864.321873","article-title":"Approximate algorithms for 0\u20131 knapsack problems","volume":"22","author":"Sahni","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/0166-218X(87)90024-2_BIB32","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1287\/mnsc.15.4.B196","article-title":"An approach to linear programming with 0\u20131 variables","volume":"15","author":"Senju","year":"1968","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(87)90024-2_BIB33","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1287\/opre.15.2.319","article-title":"A finite renewal algorithm for the knapsack and turnpike models","volume":"15","author":"Shapiro","year":"1967","journal-title":"Operations Research"},{"key":"10.1016\/0166-218X(87)90024-2_BIB34","series-title":"A pseudopolynomial time algorithm for linear diophantine equations","author":"Soma","year":"1987"},{"key":"10.1016\/0166-218X(87)90024-2_BIB35","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1007\/BF02243880","article-title":"Dynamic programming algorithms for the zero\u2013one knapsack problem","volume":"25","author":"Toth","year":"1980","journal-title":"Computing"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900242?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X87900242?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T01:53:17Z","timestamp":1555120397000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X87900242"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,11]]},"references-count":35,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,11]]}},"alternative-id":["0166218X87900242"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(87)90024-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1987,11]]}}}