{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,14]],"date-time":"2025-07-14T02:27:57Z","timestamp":1752460077298},"reference-count":16,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":["Operations Research Letters"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0167-6377(91)90082-z","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T14:40:45Z","timestamp":1056984045000},"page":"23-26","source":"Crossref","is-referenced-by-count":21,"title":["A linear-time algorithm for solving continuous maximin knapsack problems"],"prefix":"10.1016","volume":"10","author":[{"given":"Takahito","family":"Kuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hiroshi","family":"Konno","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eitan","family":"Zemel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90082-Z_BIB1","series-title":"The Design and Analysis of Computer Algorithm","author":"Aho","year":"1974"},{"key":"10.1016\/0167-6377(91)90082-Z_BIB2","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-6377(85)90017-3","article-title":"Minimax linear programming","volume":"4","author":"Ahuja","year":"1985","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB3","doi-asserted-by":"crossref","first-page":"1130","DOI":"10.1287\/opre.28.5.1130","article-title":"An algorithm for large zero-one knapsack problems","volume":"28","author":"Balas","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB4","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02591729","article-title":"An O(n) algorithm for the multiple-choice knapsack linear program","volume":"8","author":"Dyer","year":"1984","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90082-Z_BIB5","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/BF02591994","article-title":"Continuous maximin knapsack problems with GLB constraints","volume":"36","author":"Eiselt","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90082-Z_BIB6","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1287\/mnsc.16.5.327","article-title":"A branch search algorithm for the knapsack problems","volume":"16","author":"Greenberg","year":"1970","journal-title":"Management Sci."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB7","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":"Oper. Res."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB8","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/1520-6750(198906)36:3<311::AID-NAV3220360308>3.0.CO;2-L","article-title":"A modified GUB algorithm for solving linear minimax problems","volume":"36","author":"Kuno","year":"1989","journal-title":"Naval Res. Logist. Quart."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB9","series-title":"Institute of Human and Social Sciences Report IHSS 88-8","article-title":"An efficient algorithm for solving continuous maximin knapsack problems","author":"Kuno","year":"1988"},{"key":"10.1016\/0167-6377(91)90082-Z_BIB10","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1137\/0207013","article-title":"Selecting the k-th element in X + Y and X1 + X2 \u2026 Xm","volume":"7","author":"Johnson","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB11","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","article-title":"Combinatorial optimization with rational objective function","volume":"4","author":"Megiddo","year":"1979","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB12","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","article-title":"Applying parallel computation algorithm in the design of serial algorithms","volume":"30","author":"Megiddo","year":"1983","journal-title":"J. ACM"},{"key":"10.1016\/0167-6377(91)90082-Z_BIB13","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BF01589343","article-title":"Linear max-min programming","volume":"20","author":"Posner","year":"1981","journal-title":"Math. Programming"},{"key":"10.1016\/0167-6377(91)90082-Z_BIB14","doi-asserted-by":"crossref","first-page":"1412","DOI":"10.1287\/opre.28.6.1412","article-title":"The multiple choice knapsack problem","volume":"28","author":"Zemel","year":"1980","journal-title":"Oper. Res."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB15","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/0020-0190(84)90014-0","article-title":"An O(n) algorithm for the linear multiple choice knapsack problem and related problems","volume":"18","author":"Zemel","year":"1984","journal-title":"Information Processing Lett."},{"key":"10.1016\/0167-6377(91)90082-Z_BIB16","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/BF01840350","article-title":"A linear time randomizing algorithm for searching ranked functions","volume":"2","author":"Zemel","year":"1987","journal-title":"Algorithmica"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190082Z?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190082Z?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T05:26:36Z","timestamp":1552886796000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779190082Z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":16,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["016763779190082Z"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90082-z","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}