{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T18:59:56Z","timestamp":1786215596665,"version":"3.56.0"},"reference-count":10,"publisher":"Elsevier BV","issue":"10","license":[{"start":{"date-parts":[[1997,10,1]],"date-time":"1997-10-01T00:00:00Z","timestamp":875664000000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1997,10]]},"DOI":"10.1016\/s0305-0548(97)00009-9","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"961-967","source":"Crossref","is-referenced-by-count":17,"title":["Heuristic and reduction algorithms for the knapsack sharing problem"],"prefix":"10.1016","volume":"24","author":[{"given":"Takeo","family":"Yamada","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mayumi","family":"Futakawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(97)00009-9_BIB1","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/opre.27.2.341","article-title":"The knapsack sharing problem","volume":"27","author":"Brown","year":"1979","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB2","author":"Garey","year":"1978"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB3","doi-asserted-by":"crossref","first-page":"460","DOI":"10.1287\/mnsc.20.4.460","article-title":"Reduction algorithms for zero-one single knapsack problems","volume":"20","author":"Ingargiola","year":"1973","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB4","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1287\/mnsc.17.11.780","article-title":"On marginal allocation in single constraint min-max problems","volume":"17","author":"Jacobsen","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB5","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1287\/opre.22.4.802","article-title":"Application of programs with maximum objective functions to problems of optimal resource allocation","volume":"22","author":"Kaplan","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB6","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(91)90082-Z","article-title":"A linear-time algorithm for solving continuous maximin knapsack problems","volume":"10","author":"Kuno","year":"1991","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB7","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0377-2217(92)90335-7","article-title":"Minimax resource allocation problems: optimization and parametric analysis","volume":"60","author":"Luss","year":"1992","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB8","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB9","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1287\/mnsc.18.9.502","article-title":"More on min-max allocation","volume":"17","author":"Porteus","year":"1972","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(97)00009-9_BIB10","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/opre.36.2.359","article-title":"A max-min allocation problem: its solutions and applications","volume":"36","author":"Tang","year":"1988","journal-title":"Operations Research"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000099?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054897000099?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T00:59:27Z","timestamp":1556672367000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054897000099"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,10]]},"references-count":10,"journal-issue":{"issue":"10","published-print":{"date-parts":[[1997,10]]}},"alternative-id":["S0305054897000099"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(97)00009-9","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1997,10]]}}}