{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:53:00Z","timestamp":1764996780569},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[1980,3,1]],"date-time":"1980-03-01T00:00:00Z","timestamp":320716800000},"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":[[1980,3]]},"DOI":"10.1007\/bf02243880","type":"journal-article","created":{"date-parts":[[2005,11,15]],"date-time":"2005-11-15T01:03:25Z","timestamp":1132016605000},"page":"29-45","source":"Crossref","is-referenced-by-count":116,"title":["Dynamic programming algorithms for the Zero-One Knapsack Problem"],"prefix":"10.1007","volume":"25","author":[{"given":"P.","family":"Toth","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02243880_CR1","doi-asserted-by":"crossref","unstructured":"Ahrens, J. H., Finke, G.: Merging and sorting applied to the zero-one Knapsack problem. Operations Research23 (1975).","DOI":"10.1287\/opre.23.6.1099"},{"key":"BF02243880_CR2","unstructured":"Barr, R. S., Ross, G. T.: A linked list data structure for a binary Knapsack algorithm. Research Report CCS 232, Centre for Cybernetic Studies, University of Texas (1975)."},{"key":"BF02243880_CR3","doi-asserted-by":"crossref","unstructured":"Greenberg, H., Hegerich, R. L.: A branch search algorithm for the Knapsack problem. Management Science16 (1970).","DOI":"10.1287\/mnsc.16.5.327"},{"key":"BF02243880_CR4","doi-asserted-by":"crossref","unstructured":"Horowitz, E., Sahni, S.: Computing partitions with applications to the Knapsack problem. J. ACM21 (1974).","DOI":"10.1145\/321812.321823"},{"key":"BF02243880_CR5","doi-asserted-by":"crossref","unstructured":"Ingargiola, G. P., Korsh, J. F.: A reduction algorithm for zero-one single Knapsack problems. Management Science20 (1973).","DOI":"10.1287\/mnsc.20.4.460"},{"key":"BF02243880_CR6","doi-asserted-by":"crossref","unstructured":"Kolesar, P. J.: A branch and bound algorithm for the Knapsack problem. Management Science13 (1967).","DOI":"10.1287\/mnsc.13.9.723"},{"key":"BF02243880_CR7","doi-asserted-by":"crossref","unstructured":"Magazine, M., Nemhauser, G., Trotter, L.: When the greedy solution solves a class of Knapsack problems. Operations Research23 (19750.","DOI":"10.1287\/opre.23.2.207"},{"key":"BF02243880_CR8","doi-asserted-by":"crossref","unstructured":"Martello, S., Toth, P.: An upper bound for ther zero-one Knapsack problem and a branch and bound algorithm. European Journal of Operational Research1 (1977).","DOI":"10.1016\/0377-2217(77)90024-8"},{"key":"BF02243880_CR9","volume-title":"Combinatorial optimization","author":"S. Martello","year":"1979","unstructured":"Martello, S., Toth, P.: The 0\u20131 Knapsack problem, in: Combinatorial optimization (Christofides, N., Mingozzi, A., Sandi, C., Toth, P., eds.). London: J. Wiley 1979."},{"key":"BF02243880_CR10","doi-asserted-by":"crossref","unstructured":"Morin, T. L., Marsten, R. E.: Branch and bound strategies for dynamic programming. Operations Research24 (1976).","DOI":"10.1287\/opre.24.4.611"},{"key":"BF02243880_CR11","doi-asserted-by":"crossref","unstructured":"Nauss, R. M.: An efficient algorithm for the 0\u20131 Knapsack problem. Management Science23 (1976).","DOI":"10.1287\/mnsc.23.1.27"},{"key":"BF02243880_CR12","unstructured":"Toth, P.: A new reduction algorithm for 0\u20131 Knapsack problems. Presented at ORSA\/TIMS Joint National Meeting, Miami (November 1976)."},{"key":"BF02243880_CR13","doi-asserted-by":"crossref","unstructured":"Zoltners, A. A.: A direct descent binary Knapsack algorithm. J. ACM25 (1978).","DOI":"10.1145\/322063.322073"}],"container-title":["Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243880.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02243880\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243880","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T22:07:15Z","timestamp":1586556435000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02243880"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,3]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1980,3]]}},"alternative-id":["BF02243880"],"URL":"https:\/\/doi.org\/10.1007\/bf02243880","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1980,3]]}}}