{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,2,13]],"date-time":"2024-02-13T15:00:33Z","timestamp":1707836433262},"reference-count":17,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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,1]]},"DOI":"10.1016\/s0377-2217(00)00329-5","type":"journal-article","created":{"date-parts":[[2002,10,14]],"date-time":"2002-10-14T11:56:01Z","timestamp":1034596561000},"page":"57-66","source":"Crossref","is-referenced-by-count":16,"title":["An exact algorithm for the subset sum problem"],"prefix":"10.1016","volume":"136","author":[{"given":"Nei Yoshihiro","family":"Soma","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(00)00329-5_BIB1","unstructured":"D. Avis, Theorem 3, in: V. Chv\u00e1tal, Hard knapsack problems, Operations Research 28 (1980) 1410\u20131411"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB2","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero\u2013one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB3","unstructured":"L.E. Dickson, A History of the Theory of Numbers, vol. 3, Carnegie Institution, Washington, 1923"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB4","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\/S0377-2217(00)00329-5_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1989"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","article-title":"Fast approximation algorithms for knapsack problems","volume":"4","author":"Lawler","year":"1979","journal-title":"Mathematics of Operations Research"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB7","series-title":"A Course in Combinatorics","author":"van Lint","year":"1992"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB8","doi-asserted-by":"crossref","first-page":"765","DOI":"10.1287\/mnsc.30.6.765","article-title":"A mixture of dynamic programming and branch-and-bound for the subset sum problem","volume":"30","author":"Martello","year":"1984","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB9","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB10","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1287\/opre.45.5.758","article-title":"A minimal algorithm for the 0\u20131 knapsack problem","volume":"46","author":"Pisinger","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB11","series-title":"Handbook of Combinatorial Optimization","article-title":"Knapsack problems","author":"Pisinger","year":"1999"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB12","series-title":"Algorithms in: C: Parts 1\u20134, Fundamentals, Data Structures, Sorting and Searching","author":"Sedgewick","year":"1998"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB13","unstructured":"N.Y. Soma, P. Toth, Embedding trees into the dynamic programming search space, Technical Report DEIS, University of Bologna, 1999"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB14","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(94)00106-N","article-title":"A polynomial approximation scheme for the subset sum problem","volume":"57","author":"Soma","year":"1995","journal-title":"Discrete Applied Mathematics"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB15","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0020-0190(86)90123-7","article-title":"The bounded subset sum problem is almost everywhere randomly decidable in O(n)","volume":"23","author":"Tinhofer","year":"1986","journal-title":"Information Processing Letters"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB16","unstructured":"M. Todd, Theorem 3, in: V. Chv\u00e1tal, Hard knapsack problems, Operations Research 28 (1980) 1408\u20131409"},{"key":"10.1016\/S0377-2217(00)00329-5_BIB17","unstructured":"H.H. Yanasse, N.Y. Soma, An exact pseudopolynomial algorithm for the value independent knapsack problem, in: Proceedings of the XX SBPO, vol. 1, Salvador, 1987, pp. 710\u2013719"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700003295?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221700003295?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,6]],"date-time":"2019-05-06T14:24:44Z","timestamp":1557152684000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221700003295"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":17,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["S0377221700003295"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(00)00329-5","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}