{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T00:42:53Z","timestamp":1777596173573,"version":"3.51.4"},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0377-2217(97)00165-3","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T19:55:41Z","timestamp":1052769341000},"page":"177-183","source":"Crossref","is-referenced-by-count":26,"title":["Some exact algorithms for the knapsack sharing problem"],"prefix":"10.1016","volume":"106","author":[{"given":"Takeo","family":"Yamada","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mayumi","family":"Futakawa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seiji","family":"Kataoka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(97)00165-3_BIB1","series-title":"Dynamic Programming","author":"Bellman","year":"1957"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB2","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\/S0377-2217(97)00165-3_BIB3","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/BF01582227","article-title":"Bounded knapsack sharing","volume":"67","author":"Brown","year":"1994","journal-title":"Mathematical Programming"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB4","series-title":"Linear Programming","author":"Chv\u00e1tal","year":"1983"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB5","series-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB6","doi-asserted-by":"crossref","first-page":"277","DOI":"10.1145\/321812.321823","article-title":"Computing partitions with applications to the knapsack problem","volume":"21","author":"Horowitz","year":"1974","journal-title":"Journal of the ACM"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB7","doi-asserted-by":"crossref","first-page":"780","DOI":"10.1287\/mnsc.17.11.780","article-title":"On marginal allocation in single constraint minmax problems","volume":"17","author":"Jacobsen","year":"1971","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB8","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1287\/opre.22.4.802","article-title":"Application of programs with maximin objective functions to problems of optimal resource allocation","volume":"22","author":"Kaplan","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB9","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\/S0377-2217(97)00165-3_BIB10","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-6377(91)90057-V","article-title":"A nonlinear minimax allocation problem with multiple knapsack constraints","volume":"10","author":"Luss","year":"1991","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB11","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\/S0377-2217(97)00165-3_BIB12","series-title":"Knapsack Problems: Algorithms and Computer Implementations","author":"Martello","year":"1990"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB13","series-title":"Integer and Combinatorial Optimization","author":"Nemhauser","year":"1988"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB14","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1287\/mnsc.18.9.502","article-title":"More on min-max allocation","volume":"18","author":"Porteus","year":"1972","journal-title":"Management Science"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB15","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"},{"key":"10.1016\/S0377-2217(97)00165-3_BIB16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1287\/opre.29.1.207","article-title":"Integer allocation problems of min-max type with quasiconvex separable functions","volume":"29","author":"Zeitlin","year":"1981","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001653?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221797001653?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:58:13Z","timestamp":1556643493000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221797001653"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0377221797001653"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(97)00165-3","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}