{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T02:51:12Z","timestamp":1673319072594},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1978,3,1]],"date-time":"1978-03-01T00:00:00Z","timestamp":257558400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computing"],"published-print":{"date-parts":[[1978,3]]},"DOI":"10.1007\/bf02252196","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T08:24:25Z","timestamp":1132043065000},"page":"81-86","source":"Crossref","is-referenced-by-count":25,"title":["Algorithm 37 Algorithm for the solution of the 0\u20131 single knapsack problem"],"prefix":"10.1007","volume":"21","author":[{"given":"S.","family":"Martello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02252196_CR1","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","volume":"21","author":"E. Horowitz","year":"1974","unstructured":"Horowitz, E., Sahni, S.: Computing Partitions with Applications to the Knapsack Problem. Journal of ACM21, 277\u2013292 (1974).","journal-title":"Journal of ACM"},{"key":"BF02252196_CR2","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.20.4.460","volume":"20","author":"G. P. Ingargiola","year":"1973","unstructured":"Ingargiola, G. P., Korsh, J. F.: Reduction Algorithm for Zero-One Single Knapsack Problems. Management Science20, 460\u2013463 (1973).","journal-title":"Management Science"},{"key":"BF02252196_CR3","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0377-2217(77)90024-8","volume":"1","author":"S. Martello","year":"1977","unstructured":"Martello, S., Toth, P.: An Upper Bound for the Zero-One Knapsack Problem and a Branch and Bound Algorithm. European Journal of Operational Research1, 169\u2013175 (1977).","journal-title":"European Journal of Operational Research"},{"key":"BF02252196_CR4","unstructured":"Martello, S., Toth, P.: A Computational Study on Large-Size Unidimensional Knapsack Problems. Presented at the TIMS\/ORSA Joint National Meeting, San Francisco (1977)."},{"key":"BF02252196_CR5","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1287\/mnsc.23.1.27","volume":"23","author":"R. M. Nauss","year":"1976","unstructured":"Nauss, R. M.: An Efficient Algorithm for the 0\u20131 Knapsack Problem. Management Science23, 27\u201331 (1976).","journal-title":"Management Science"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252196.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02252196\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02252196","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T10:46:11Z","timestamp":1558003571000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02252196"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1978,3]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1978,3]]}},"alternative-id":["BF02252196"],"URL":"https:\/\/doi.org\/10.1007\/bf02252196","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1978,3]]}}}