{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T06:08:33Z","timestamp":1770962913374,"version":"3.50.1"},"reference-count":7,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1984,2,1]],"date-time":"1984-02-01T00:00:00Z","timestamp":444441600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1984,2]]},"DOI":"10.1007\/bf02612360","type":"journal-article","created":{"date-parts":[[2007,4,27]],"date-time":"2007-04-27T06:54:07Z","timestamp":1177656847000},"page":"198-205","source":"Crossref","is-referenced-by-count":24,"title":["Worst-case analysis of greedy algorithms for the subset-sum problem"],"prefix":"10.1007","volume":"28","author":[{"given":"Silvano","family":"Martello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Toth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02612360_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.26.1.1","volume":"26","author":"M.L. Fisher","year":"1980","unstructured":"M.L. Fisher, \u201cWorst-case analysis of heuristic algorithms,\u201dManagement Science 26 (1980) 1\u201317.","journal-title":"Management Science"},{"key":"BF02612360_CR2","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson,Computers and intractability: a guide to the theory of NP-completeness (Freeman, San Francisco, 1979)."},{"key":"BF02612360_CR3","series-title":"Lecture Notes in Control and Information Sciences","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BFb0006603","volume-title":"Optimization techniques, Part 2","author":"G.V. Gens","year":"1980","unstructured":"G.V. Gens and E.V. Levner, \u201cFast approximation algorithms for knapsack type problems,\u201d in: K. Iracki, K. Malanowski and S. Walukiewicz, eds.,Optimization techniques, Part 2, Lecture Notes in Control and Information Sciences 23 (Springer, Berlin, 1980) pp. 185\u2013194."},{"key":"BF02612360_CR4","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O.H. Ibarra","year":"1975","unstructured":"O.H. Ibarra and C.E. Kim, \u201cFast approximation algorithms for the knapsack and sum of subset problems,\u201dJournal of the ACM 22 (1975) 463\u2013468.","journal-title":"Journal of the ACM"},{"key":"BF02612360_CR5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"D.S. Johnson, \u201cApproximation algorithms for combinatorial problems,\u201dJournal of Computer and System Sciences 9 (1974) 256\u2013278.","journal-title":"Journal of Computer and System Sciences"},{"key":"BF02612360_CR6","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1287\/moor.4.4.339","volume":"4","author":"E. L. Lawler","year":"1979","unstructured":"E. L. Lawler, \u201cFast approximation algorithms for knapsack problems,\u201dMathematics of Operations Research 4 (1979) 339\u2013356.","journal-title":"Mathematics of Operations Research"},{"key":"BF02612360_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1145\/321864.321873","volume":"22","author":"S. Sahni","year":"1975","unstructured":"S. Sahni, \u201cApproximate algorithms for the 0\/1 knapsack problem,\u201dJournal of the ACM 22 (1975) 115\u2013124.","journal-title":"Journal of the ACM"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612360.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02612360\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02612360","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T08:34:25Z","timestamp":1558341265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02612360"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,2]]},"references-count":7,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1984,2]]}},"alternative-id":["BF02612360"],"URL":"https:\/\/doi.org\/10.1007\/bf02612360","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1984,2]]}}}