{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T14:04:47Z","timestamp":1761487487176},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1981,6,1]],"date-time":"1981-06-01T00:00:00Z","timestamp":360201600000},"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":[[1981,6]]},"DOI":"10.1007\/bf02243544","type":"journal-article","created":{"date-parts":[[2005,11,14]],"date-time":"2005-11-14T21:19:42Z","timestamp":1132003182000},"page":"93-112","source":"Crossref","is-referenced-by-count":74,"title":["Heuristic algorithms for the multiple knapsack problem"],"prefix":"10.1007","volume":"27","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":"BF02243544_CR1","doi-asserted-by":"crossref","unstructured":"Fisk, J. C., Hung, M. S.: A heuristic routine for solving large loading problems. Presented at the TIMS\/ORSA Joint National Meeting, New Orleans, May 1979.","DOI":"10.1002\/nav.3800260409"},{"key":"BF02243544_CR2","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1002\/nav.3800250316","volume":"25","author":"M. S. Hung","year":"1978","unstructured":"Hung, M. S., Fisk, J. C.: An algorithm for 0\u20131 multiple knapsack problems. Naval Research Logistics Quarterly25, 571\u2013579 (1978).","journal-title":"Naval Research Logistics Quarterly"},{"key":"BF02243544_CR3","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF02252196","volume":"21","author":"S. Martello","year":"1978","unstructured":"Martello, S., Toth, P.: Algorithm for the solution of the 0\u20131 single knapsack problem. Computing21, 81\u201386 (1978).","journal-title":"Computing"},{"key":"BF02243544_CR4","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/0377-2217(80)90112-5","volume":"4","author":"S. Martello","year":"1980","unstructured":"Martello, S., Toth, P.: Solution of the 0\u20131 multiple knapsack problem. Europ. J. Operat. Res.4, 276\u2013283 (1980).","journal-title":"Europ. J. Operat. Res."},{"key":"BF02243544_CR5","doi-asserted-by":"crossref","unstructured":"Martello, S., Toth, P.: A bound and bound algorithm for the zero-one multiple knapsack problem. Discrete Applied Mathematics (to appear).","DOI":"10.1016\/0166-218X(81)90005-6"}],"container-title":["Computing"],"original-title":[],"language":"de","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243544.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02243544\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02243544","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T23:31:48Z","timestamp":1557876708000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02243544"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1981,6]]}},"alternative-id":["BF02243544"],"URL":"https:\/\/doi.org\/10.1007\/bf02243544","relation":{},"ISSN":["0010-485X","1436-5057"],"issn-type":[{"value":"0010-485X","type":"print"},{"value":"1436-5057","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,6]]}}}