{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:26:26Z","timestamp":1751880386968},"reference-count":18,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,6,1]],"date-time":"1991-06-01T00:00:00Z","timestamp":675734400000},"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,6]]},"DOI":"10.1016\/0167-6377(91)90057-v","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"183-187","source":"Crossref","is-referenced-by-count":26,"title":["A nonlinear minimax allocation problem with multiple knapsack constraints"],"prefix":"10.1016","volume":"10","author":[{"given":"Hanan","family":"Luss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(91)90057-V_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\/0167-6377(91)90057-V_BIB2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BF02591771","article-title":"The flow circulation sharing problem","volume":"25","author":"Brown","year":"1983","journal-title":"Mathematical programming"},{"key":"10.1016\/0167-6377(91)90057-V_BIB3","article-title":"Sharing (maximin and minimax) constrained optimization","author":"Brown","year":"1989"},{"key":"10.1016\/0167-6377(91)90057-V_BIB4","doi-asserted-by":"crossref","unstructured":"J.R. Brown, \u201cSolving knapsack sharing with general tradeoff functions\u201d, Mathematical Programming, to appear.","DOI":"10.1007\/BF01586926"},{"key":"10.1016\/0167-6377(91)90057-V_BIB5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0377-2217(86)90187-6","article-title":"A graphical method to solve a maximin allocation problem","volume":"26","author":"Czuchra","year":"1986","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/0167-6377(91)90057-V_BIB6","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/BF02591994","article-title":"Continuous maximin knapsack problems with GLB constraints","volume":"36","author":"Eislet","year":"1986","journal-title":"Mathematical Programming"},{"key":"10.1016\/0167-6377(91)90057-V_BIB7","series-title":"Resource Allocation Problems: Algorithmic Approaches","author":"Ibaraki","year":"1988"},{"key":"10.1016\/0167-6377(91)90057-V_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"},{"issue":"3","key":"10.1016\/0167-6377(91)90057-V_BIB9","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/j.1538-7305.1989.tb00323.x","article-title":"Allocation of scarce resources in manufacturing facilities","volume":"68","author":"King","year":"1989","journal-title":"AT&T Technical Journal"},{"key":"10.1016\/0167-6377(91)90057-V_BIB10","doi-asserted-by":"crossref","DOI":"10.1287\/opre.39.2.285","article-title":"Minimax resource allocation with tree structured substitutable resources","volume":"39","author":"Klein","year":"1991","journal-title":"Operations Research"},{"key":"10.1016\/0167-6377(91)90057-V_BIB11","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6377(87)90013-7","article-title":"An algorithm for separable nonlinear minimax problems","volume":"6","author":"Luss","year":"1987","journal-title":"Operations Research Letters"},{"key":"10.1016\/0167-6377(91)90057-V_BIB12","doi-asserted-by":"crossref","unstructured":"H. Luss, \u201cMinimax resource allocation problems: Optimization and parametric analysis\u201d, European Journal of Operational Research, to appear.","DOI":"10.1016\/0377-2217(92)90335-7"},{"key":"10.1016\/0167-6377(91)90057-V_BIB13","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1287\/opre.23.2.360","article-title":"Allocation of effort among competing activities","volume":"23","author":"Luss","year":"1975","journal-title":"Operations Research"},{"key":"10.1016\/0167-6377(91)90057-V_BIB14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0167-6377(86)90012-X","article-title":"Resource allocation among competing activities: A lexicographic minimax approach","volume":"5","author":"Luss","year":"1986","journal-title":"Operations Research Letters"},{"key":"10.1016\/0167-6377(91)90057-V_BIB15","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1145\/359060.359077","article-title":"Optimal storage allocation for serial files","volume":"22","author":"Mendelson","year":"1979","journal-title":"Communications of the ACM"},{"key":"10.1016\/0167-6377(91)90057-V_BIB16","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF01933625","article-title":"Max-min resource allocation","volume":"23","author":"Mjelde","year":"1983","journal-title":"BIT"},{"key":"10.1016\/0167-6377(91)90057-V_BIB17","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\/0167-6377(91)90057-V_BIB18","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1287\/mnsc.26.1.34","article-title":"Simple ranking methods for allocation of one resource","volume":"26","author":"Zipkin","year":"1980","journal-title":"Management Science"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190057V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779190057V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:26:59Z","timestamp":1552901219000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779190057V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,6]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,6]]}},"alternative-id":["016763779190057V"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(91)90057-v","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1991,6]]}}}