{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T13:34:29Z","timestamp":1762954469546},"reference-count":36,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,3,1]],"date-time":"1994-03-01T00:00:00Z","timestamp":762480000000},"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":[[1994,3]]},"DOI":"10.1007\/bf01582580","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:39:29Z","timestamp":1114677569000},"page":"337-363","source":"Crossref","is-referenced-by-count":14,"title":["Relaxation-based algorithms for minimax optimization problems with resource allocation applications"],"prefix":"10.1007","volume":"64","author":[{"given":"Rachelle S.","family":"Klein","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hanan","family":"Luss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uriel G.","family":"Rothblum","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-6377(85)90017-3","volume":"4","author":"R.K. Ahuja","year":"1985","unstructured":"R.K. Ahuja, \u201cMinimax linear programming problem,\u201dOperations Research Letters 4 (1985) 131\u2013134.","journal-title":"Operations Research Letters"},{"key":"CR2","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":"CR3","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1287\/opre.27.2.341","volume":"27","author":"J.R. Brown","year":"1979","unstructured":"J.R. Brown, \u201cThe knapsack sharing problem,\u201dOperations Research 27 (1979) 341\u2013355.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1287\/opre.32.5.1087","volume":"32","author":"J.R. Brown","year":"1984","unstructured":"J.R. Brown, \u201cThe linear sharing problem,\u201dOperations Research 32 (1984) 1087\u20131106.","journal-title":"Operations Research"},{"key":"CR5","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, Ohio, 1989."},{"key":"CR6","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":"CR7","unstructured":"J.R. Brown, \u201cBounded knapsack sharing,\u201d in review (1991)."},{"key":"CR8","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":"CR9","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\u201d,European Journal of Operational Research 26 (1986) 259\u2013261.","journal-title":"European Journal of Operational Research"},{"key":"CR10","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":"CR11","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1007\/BF02591994","volume":"36","author":"H.A. Eislet","year":"1986","unstructured":"H.A. Eislet, \u201cContinuous maximin knapsack problems with GLB constraints,\u201dMathematical Programming 36 (1986) 114\u2013121.","journal-title":"Mathematical Programming"},{"key":"CR12","doi-asserted-by":"crossref","unstructured":"D. Goldfarb and M.D. Grigoriadis, in:Fortran Codes for Network Optimization, B. Simeone et al., ed., \u201cA computational comparison of the Dinic and the network simplex methods for maximum flows,\u201d Annals of Operations Research 13, No. 1\u20134, Baltzer, Bazel, Switzerland, 1988.","DOI":"10.1007\/BF02288321"},{"key":"CR13","volume-title":"Production and Inventory Management","author":"A.C. Hax","year":"1984","unstructured":"A.C. Hax and D. Candea,Production and Inventory Management (Prentice Hall, Englewood Cliffs, NJ, 1984)."},{"key":"CR14","unstructured":"D.S. Hochbaum and J. Naor, \u201cSimple and fast algorithms for linear and integer programs with two variables per inequality,\u201d unpublished manuscript, 1991."},{"key":"CR15","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":"CR16","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"},{"issue":"3","key":"CR17","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1002\/j.1538-7305.1989.tb00323.x","volume":"68","author":"J.H. King","year":"1989","unstructured":"J.H. King, \u201cAllocation of scarce resources in manufacturing facilities,\u201dAT&T Technical Journal 68 (3) (1989) 103\u2013113.","journal-title":"AT&T Technical Journal"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1287\/opre.39.2.285","volume":"39","author":"R.S. Klein","year":"1991","unstructured":"R.S. Klein and H. Luss, \u201cMinimax resource allocation with tree structured substitutable resources,\u201dOperations Research 39 (1991) 285\u2013295.","journal-title":"Operations Research"},{"key":"CR19","doi-asserted-by":"crossref","first-page":"959","DOI":"10.1287\/opre.41.5.959","volume":"41","author":"R.S. Klein","year":"1993","unstructured":"R.S. Klein, H. Luss and U.G. Rothblum, \u201cMinimax resource allocation problems with resource substitutions represented by graphs,\u201dOperations Research 41 (1993) 959\u2013971.","journal-title":"Operations Research"},{"key":"CR20","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1007\/BF01581200","volume":"55","author":"R.S. Klein","year":"1992","unstructured":"R.S. Klein, H. Luss and D.R. Smith, \u201cA lexicographic minimax algorithm for multiperiod resource allocation,\u201dMathematical Programming 55 (1992) 213\u2013234.","journal-title":"Mathematical Programming"},{"key":"CR21","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0167-6377(91)90082-Z","volume":"10","author":"T. Kuno","year":"1991","unstructured":"T. Kuno, H. Konno and E. Zemel, \u201cA linear-time algorithm for solving continuous maximin knapsack problems,\u201dOperations Research Letters 10 (1991) 23\u201326.","journal-title":"Operations Research Letters"},{"key":"CR22","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1002\/1520-6750(198906)36:3<311::AID-NAV3220360308>3.0.CO;2-L","volume":"36","author":"T. Kuno","year":"1989","unstructured":"T. Kuno, K. Mori and H. Konno, \u201cA modified GUB algorithm for solving linear minimax problems,\u201dNaval Research Logistics 36 (1989) 311\u2013320.","journal-title":"Naval Research Logistics"},{"key":"CR23","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":"CR24","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0167-6377(91)90057-V","volume":"10","author":"H. Luss","year":"1991","unstructured":"H. Luss, \u201cA nonlinear minimax allocation problem with multiple knapsack constraints,\u201dOperations Research Letters 10 (1991) 183\u2013187.","journal-title":"Operations Research Letters"},{"key":"CR25","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1016\/0377-2217(92)90335-7","volume":"60","author":"H. Luss","year":"1992","unstructured":"H. Luss, \u201cMinimax resource allocation problems: Optimization and parametric analysis,\u201dEuropean Journal of Operational Research 60 (1992) 76\u201386.","journal-title":"European Journal of Operational Research"},{"key":"CR26","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":"CR27","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":"CR28","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":"CR29","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF01933625","volume":"23","author":"K.M. Mjelde","year":"1983","unstructured":"K.M. Mjelde, \u201cMax\u2014min resource allocation,\u201dBIT 23 (1983) 529\u2013537.","journal-title":"BIT"},{"key":"CR30","volume-title":"Methods of Allocation of Limited Resources","author":"K.M. Mjelde","year":"1983","unstructured":"K.M. Mjelde,Methods of Allocation of Limited Resources (John Wiley, New York, 1983)."},{"key":"CR31","volume-title":"Linear and Combinatorial Programming","author":"K.G. Murty","year":"1976","unstructured":"K.G. Murty,Linear and Combinatorial Programming (John Wiley, New York, 1976)."},{"key":"CR32","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1287\/mnsc.39.8.964","volume":"39","author":"Q.C. Nguyen","year":"1993","unstructured":"Q.C. Nguyen and R.E. Stone, \u201cA multiperiod minimax resource allocation problem with substitutable resources,\u201dManagement Science 39 (1993) 964\u2013974.","journal-title":"Management Science"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0377-2217(89)90387-1","volume":"41","author":"J-S. Pang","year":"1989","unstructured":"J-S. Pang and C-S Yu, \u201cA min\u2014max resource allocation problem with substitutions,\u201dEuropean Journal of Operational Research 41 (1989) 218\u2013223.","journal-title":"European Journal of Operational Research"},{"key":"CR34","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\u2014min programming,\u201dMathematical Programming 20 (1981) 166\u2013172.","journal-title":"Mathematical Programming"},{"key":"CR35","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\u2014min allocation problem: Its solutions and applications,\u201dOperations Research 36 (1988) 359\u2013367.","journal-title":"Operations Research"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"681","DOI":"10.1016\/0024-3795(89)90488-6","volume":"114\/115","author":"A.F. Veinott Jr.","year":"1989","unstructured":"A.F. Veinott, Jr., \u201cRepresentation of general and polyhedral subsemilattices and lattices of product spaces,\u201dLinear Algebra and Its Applications 114\/115 (1989) 681\u2013704.","journal-title":"Linear Algebra and Its Applications"}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582580.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582580\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582580","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,7]],"date-time":"2020-04-07T03:47:09Z","timestamp":1586231229000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582580"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":36,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["BF01582580"],"URL":"https:\/\/doi.org\/10.1007\/bf01582580","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}