{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,23]],"date-time":"2025-10-23T20:46:58Z","timestamp":1761252418923},"reference-count":17,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,4,1]],"date-time":"1992-04-01T00:00:00Z","timestamp":702086400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1992,4]]},"DOI":"10.1007\/bf01581200","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T09:55:11Z","timestamp":1114682111000},"page":"213-234","source":"Crossref","is-referenced-by-count":38,"title":["A lexicographic minimax algorithm for multiperiod resource allocation"],"prefix":"10.1007","volume":"55","author":[{"given":"Rachelle S.","family":"Klein","sequence":"first","affiliation":[]},{"given":"Hanan","family":"Luss","sequence":"additional","affiliation":[]},{"given":"Donald R.","family":"Smith","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/0377-2217(82)90110-2","volume":"11","author":"M.S. Bazaraa","year":"1982","unstructured":"M.S. Bazaraa and J.J. Goode, \u201cAn algorithm for solving linearly constrained minimax problems,\u201dEuropean Journal of Operational Research 11 (1982) 158\u2013166.","journal-title":"European Journal of Operational Research"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/BF01586926","volume":"51","author":"J.R. Brown","year":"1991","unstructured":"J.R. Brown, \u201cSolving knapsack sharing with general tradeoff functions,\u201dMathematical Programming 51 (1991) 55\u201373.","journal-title":"Mathematical Programming"},{"key":"CR3","series-title":"working paper","volume-title":"Sharing (maximin and minimax) constrained optimization","author":"J.R. Brown","year":"1989","unstructured":"J.R. Brown, \u201cSharing (maximin and minimax) constrained optimization,\u201d working paper, Graduate School of Management, Kent State University (Kent, OH, 1989)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"817","DOI":"10.1080\/00401706.1971.10488852","volume":"13","author":"R.L. Chaddha","year":"1971","unstructured":"R.L. Chaddha, W.W. Hardgrave, D.J. Hudson, M. Segal and J.W. Suurballe, \u201cAllocation of total sample size when only the stratum means are of interest,\u201dTechnometrics 13 (1971) 817\u2013831.","journal-title":"Technometrics"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0377-2217(86)90187-6","volume":"26","author":"W. Czuchra","year":"1986","unstructured":"W. Czuchra, \u201cA graphical method to solve a maximin allocation problem,\u201dEuropean Journal of Operational Research 26 (1986) 259\u2013261.","journal-title":"European Journal of Operational Research"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1007\/BF01584333","volume":"13","author":"R.S.K. Dutta","year":"1977","unstructured":"R.S.K. Dutta and M. Vidyasagar, \u201cNew algorithm for constrained minimax optimization,\u201dMathematical Programming 13 (1977) 140\u2013155.","journal-title":"Mathematical Programming"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/BF02591994","volume":"36","author":"H.A. Eiselt","year":"1986","unstructured":"H.A. Eiselt, \u201cContinuous maximin knapsack problems with GLB constraints,\u201dMathematical Programming 36 (1986) 114\u2013121.","journal-title":"Mathematical Programming"},{"key":"CR8","volume-title":"Resource Allocation Problems: Algorithmic Approaches","author":"T. Ibaraki","year":"1988","unstructured":"T. Ibaraki and N. Katoh,Resource Allocation Problems: Algorithmic Approaches (MIT Press, Cambridge, MA, 1988)."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"802","DOI":"10.1287\/opre.22.4.802","volume":"22","author":"S. Kaplan","year":"1974","unstructured":"S. Kaplan, \u201cApplication of programs with maximin objective functions to problems of optimal resource allocation,\u201dOperations Research 22 (1974) 802\u2013807.","journal-title":"Operations Research"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1016\/0167-6377(87)90013-7","volume":"6","author":"H. Luss","year":"1987","unstructured":"H. Luss, \u201cAn algorithm for separable nonlinear minimax problems,\u201dOperations Research Letters 6 (1987) 159\u2013162.","journal-title":"Operations Research Letters"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0167-6377(86)90012-X","volume":"5","author":"H. Luss","year":"1986","unstructured":"H. Luss and D.R. Smith, \u201cResource allocation among competing activities: A lexicographic minimax approach,\u201dOperations Research Letters 5 (1986) 227\u2013231.","journal-title":"Operations Research Letters"},{"key":"CR12","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1002\/1520-6750(198808)35:4<493::AID-NAV3220350405>3.0.CO;2-0","volume":"35","author":"H. Luss","year":"1988","unstructured":"H. Luss and D.R. Smith, \u201cMultiperiod allocation of limited resources: A minimax approach,\u201dNaval Research Logistics 35 (1988) 493\u2013501.","journal-title":"Naval Research Logistics"},{"key":"CR13","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1007\/BF01588966","volume":"14","author":"K. Madsen","year":"1978","unstructured":"K. Madsen and H. Schjaer-Jacobsen, \u201cLinearly constrained minimax optimization,\u201dMathematical Programming 14 (1978) 208\u2013223.","journal-title":"Mathematical Programming"},{"key":"CR14","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF01933625","volume":"23","author":"K.M. Mjelde","year":"1983","unstructured":"K.M. Mjelde, \u201cMax-min resource allocation,\u201dBIT 23 (1983) 529\u2013537.","journal-title":"BIT"},{"key":"CR15","volume-title":"Methods of Allocation of Limited Resources","author":"K.M. Mjelde","year":"1983","unstructured":"K.M. Mjelde,Methods of Allocation of Limited Resources (Wiley, New York, 1983)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/BF01589343","volume":"20","author":"M.E. Posner","year":"1981","unstructured":"M.E. Posner and C.-T. Wu, \u201cLinear max-min programming,\u201dMathematical Programming 20 (1981) 166\u2013172.","journal-title":"Mathematical Programming"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1287\/opre.36.2.359","volume":"36","author":"C.S. Tang","year":"1988","unstructured":"C.S. Tang, \u201cA max-min allocation problem: Its solutions and applications,\u201dOperations Research 36 (1988) 359\u2013367.","journal-title":"Operations Research"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581200.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01581200\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01581200","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:16Z","timestamp":1556896336000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01581200"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,4]]},"references-count":17,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,4]]}},"alternative-id":["BF01581200"],"URL":"https:\/\/doi.org\/10.1007\/bf01581200","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,4]]}}}