{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T22:51:25Z","timestamp":1768517485888,"version":"3.49.0"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1994,1,1]],"date-time":"1994-01-01T00:00:00Z","timestamp":757382400000},"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,1]]},"DOI":"10.1007\/bf01582060","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:37:34Z","timestamp":1114677454000},"page":"83-108","source":"Crossref","is-referenced-by-count":20,"title":["A deep cut ellipsoid algorithm for convex programming: Theory and applications"],"prefix":"10.1007","volume":"63","author":[{"given":"J. B. G.","family":"Frenk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Gromicho","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","volume-title":"Nonlinear Programming: Theory and Algorithms","author":"M.S. Bazaraa","year":"1979","unstructured":"M.S. Bazaraa and C.M. Shetty,Nonlinear Programming: Theory and Algorithms (Wiley, New York, 1979)."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"746","DOI":"10.1287\/opre.33.4.746","volume":"33","author":"O. Berman","year":"1985","unstructured":"O. Berman, R.C. Larsen and S.S. Chiu, \u201cOptimal server location on a network operating as an M\/G\/1 queue,\u201dOperations Research 33 (1985) 746\u2013771.","journal-title":"Operations Research"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1287\/opre.29.6.1039","volume":"29","author":"R.G. Bland","year":"1981","unstructured":"R.G. Bland, D. Goldfarb and M.J. Todd, \u201cThe ellipsoid method: A survey,\u201dOperations Research 29 (1981) 1039\u20131091.","journal-title":"Operations Research"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1007\/BF01149192","volume":"5","author":"O.J. Boxma","year":"1989","unstructured":"O.J. Boxma, \u201cWorkloads and waiting times in single-server systems with multiple customer classes,\u201dQueueing Systems 5 (1989) 185\u2013214.","journal-title":"Queueing Systems"},{"key":"CR5","volume-title":"What is Mathematics?","author":"R. Courant","year":"1941","unstructured":"R. Courant and H. Robbins,What is Mathematics? (Oxford University Press, Oxford, 1941)."},{"key":"CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0041-5553(65)90148-5","volume":"3","author":"A.Y. Dubovitsky","year":"1965","unstructured":"A.Y. Dubovitsky and A.A. Milyutin, \u201cExtremum problems in the presence of restriction,\u201dUSSR Computational Mathematics and Mathematical Physics 3 (1965) 1\u201380.","journal-title":"USSR Computational Mathematics and Mathematical Physics"},{"issue":"5","key":"CR7","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1007\/BFb0121078","volume":"25","author":"S.T. Dziuban","year":"1985","unstructured":"S.T. Dziuban, J.G. Ecker and M. Kupferschmid, \u201cUsing deep cuts in an ellipsoid algorithm for nonlinear programming,\u201dMathematical Programming Study 25(5) (1985) 93\u2013107.","journal-title":"Mathematical Programming Study"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02591966","volume":"27","author":"J.G. Ecker","year":"1983","unstructured":"J.G. Ecker and M. Kupferschmid, \u201cAn ellipsoid algorithm for nonlinear programming,\u201dMathematical Programming 27 (1983) 83\u2013106.","journal-title":"Mathematical Programming"},{"issue":"5","key":"CR9","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1137\/0323042","volume":"23","author":"J.G. Ecker","year":"1985","unstructured":"J.G. Ecker and M. Kupferschmid, \u201cA computational comparison of the ellipsoid algorithm with several nonlinear programming algorithms,\u201dSIAM Journal on Control and Optimization 23(5) (1985) 657\u2013674.","journal-title":"SIAM Journal on Control and Optimization"},{"key":"CR10","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.6.4.379","volume":"6","author":"J. Elzinga","year":"1972","unstructured":"J. Elzinga and D. Hearn, \u201cGeometrical solutions for some minimax location problems,\u201dTransportation Science 6 (1972) 379\u2013394.","journal-title":"Transportation Science"},{"key":"CR11","volume-title":"\u201cAn efficient algorithm to check whether0 belongs to the convex hull of a finite number of\u2112 p -circles.\u201d Report 9204\/A","author":"J.B.G. Frenk","year":"1992","unstructured":"J.B.G. Frenk, J. Gromicho, M. Fridrich and S. Zhang, \u201cAn efficient algorithm to check whether0 belongs to the convex hull of a finite number of\u2112 p -circles.\u201d Report 9204\/A, Erasmus University Rotterdam (Rotterdam, 1992)."},{"key":"CR12","unstructured":"J.B.G. Frenk, J. Gromicho and S. Zhang, \u201cA deep cut ellipsoid method for quasiconvex programming,\u201d (1992), in preparation."},{"key":"CR13","unstructured":"J.B.G. Frenk, J. Gromicho and S. Zhang, \u201cGeneral models in min-max continuous location: Theory and solution techniques,\u201d (1993), submitted for publication."},{"key":"CR14","volume-title":"\u201cThe stochastic queue location problems in the plane,\u201d Report 8948\/A","author":"J.B.G. Frenk","year":"1989","unstructured":"J.B.G. Frenk, M. Labb\u00e9, R. Visscher and S. Zhang, \u201cThe stochastic queue location problems in the plane,\u201d Report 8948\/A, Erasmus University Rotterdam (Rotterdam, 1989)."},{"key":"CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4684-6320-0","volume-title":"Exercises in Integration","author":"C. George","year":"1984","unstructured":"C. George.Exercises in Integration (Springer, New York, 1984)."},{"key":"CR16","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1287\/moor.8.1.135","volume":"8","author":"J.L. Goffin","year":"1983","unstructured":"J.L. Goffin, \u201cConvergence rates of the ellipsoid method on general convex functions,\u201dMathematics of Operations Research 8 (1983) 135\u2013150.","journal-title":"Mathematics of Operations Research"},{"key":"CR17","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02591882","volume":"30","author":"J.L. Goffin","year":"1984","unstructured":"J.L. Goffin, \u201cVariable metric relaxation methods, part II: The ellipsoid method,\u201dMathematical Programming 30 (1984) 147\u2013162.","journal-title":"Mathematical Programming"},{"key":"CR18","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/BF02579273","volume":"1","author":"M. Gr\u00f6tschel","year":"1981","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e0sz and A. Schrijver, \u201cThe ellipsoid method and its consequences in combinatorial optimization,\u201dCombinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"M. Gr\u00f6tschel, L. Lov\u00e0sz and A. Schrijver,Geometric Algorithms and Combinatorial Optimization (Springer, Berlin, 1988)."},{"key":"CR20","volume-title":"Stochastic Models in Operations Research, Vol. 1","author":"D.P. Heyman","year":"1982","unstructured":"D.P. Heyman and M.J. Sobel,Stochastic Models in Operations Research, Vol. 1 (McGraw-Hill, New York, 1982)."},{"key":"CR21","first-page":"1093","volume":"244","author":"L.G. Khachiyan","year":"1979","unstructured":"L.G. Khachiyan, \u201cA polynomial algorithm in linear programming,\u201dDoklady Akademii Nauk SSSR 244 (1979) 1093\u20131979 [In Russian.]","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"CR22","volume-title":"Queueing Systems: Theory, Vol. 1","author":"L. Kleinrock","year":"1975","unstructured":"L. Kleinrock,Queueing Systems: Theory, Vol. 1 (Wiley, New York, 1975)."},{"key":"CR23","volume-title":"The Theory of Matrices","author":"P. Lancaster","year":"1985","unstructured":"P. Lancaster and M. Tismenetsky,The Theory of Matrices (Academic Press, New York, 2nd ed., 1985).","edition":"2nd ed."},{"key":"CR24","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1287\/moor.10.3.515","volume":"10","author":"H.J. Luthi","year":"1985","unstructured":"H.J. Luthi, \u201cOn the solution of variational inequalities by the ellipsoid method,\u201dMathematics of Operations Research 10 (1985) 515\u2013522.","journal-title":"Mathematics of Operations Research"},{"key":"CR25","first-page":"57","volume":"64","author":"S. Masugama","year":"1981","unstructured":"S. Masugama, T. Ibaraki and T. Hasegawa, \u201cThe computational complexity of them-center problems on the plane,\u201dThe Transactions of the IECE of Japan 64 (1981) 57\u201364.","journal-title":"The Transactions of the IECE of Japan"},{"key":"CR26","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, \u201cLinear-time algorithms for linear programming in \u211d3 and related problems,\u201dSIAM Journal on Computing 12 (1983) 759\u2013776.","journal-title":"SIAM Journal on Computing"},{"key":"CR27","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1002\/nav.3800180409","volume":"18","author":"K.P.K. Nair","year":"1971","unstructured":"K.P.K. Nair and R. Chandresakaran, \u201cOptimal location of a single server center of certain types,\u201dNaval Research Logistics Quarterly 18 (1971) 503\u2013510.","journal-title":"Naval Research Logistics Quarterly"},{"key":"CR28","doi-asserted-by":"crossref","DOI":"10.1002\/9781118627372","volume-title":"Integer and Combinatorial Optimization","author":"G.L. Nemhauser","year":"1988","unstructured":"G.L. Nemhauser and L.A. Wolsey,Integer and Combinatorial Optimization (Wiley, New York, 1988)."},{"key":"CR29","doi-asserted-by":"crossref","DOI":"10.1515\/9781400876082","volume-title":"The Enjoyment of Mathematics","author":"H. Rademacher","year":"1957","unstructured":"H. Rademacher and O. Toeplitz,The Enjoyment of Mathematics (Princeton University Press, Princeton, NJ, 1957)."},{"key":"CR30","doi-asserted-by":"crossref","unstructured":"M.I. Shamos and D. Hoey, \u201cClosest-point problems,\u201d in:Proceedings of the 16th Annual IEEE Symposium on Foundations of Computer Science (1975) pp. 151\u2013162.","DOI":"10.1109\/SFCS.1975.8"},{"key":"CR31","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1007\/BF01070506","volume":"6","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cConvergence rate of the gradient descent method with dilation of the space,\u201dCybernetics 6 (1970) 102\u2013108.","journal-title":"Cybernetics"},{"key":"CR32","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1007\/BF02341816","volume":"6","author":"N.Z. Shor","year":"1970","unstructured":"N.Z. Shor, \u201cUtilization of the operation of space dilation in the minimization of convex functions,\u201dCybernetics 6 (1970) 7\u201315.","journal-title":"Cybernetics"},{"key":"CR33","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/BF01071394","volume":"12","author":"N.Z. Shor","year":"1977","unstructured":"N.Z. Shor, \u201cCut-off method with space extension in convex programming problems,\u201dCybernetics 12 (1977) 94\u201396.","journal-title":"Cybernetics"},{"key":"CR34","doi-asserted-by":"crossref","first-page":"881","DOI":"10.1007\/BF01068854","volume":"13","author":"N.Z. Shor","year":"1977","unstructured":"N.Z. Shor, \u201cNew development trends in nondifferentiable optimization,\u201dCybernetics 13 (1977) 881\u2013886.","journal-title":"Cybernetics"},{"key":"CR35","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1007\/BF01068900","volume":"15","author":"N.Z. Shor","year":"1980","unstructured":"N.Z. Shor and V.I. Gershovich, \u201cFamily of algorithms for solving convex programming problems,\u201dCybernetics 15 (1980) 502\u2013508.","journal-title":"Cybernetics"},{"key":"CR36","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1287\/opre.13.4.632","volume":"13","author":"R.D. Smallwood","year":"1965","unstructured":"R.D. Smallwood, \u201cMinimax detection station placement,\u201dOperations Research 13 (1965) 636\u2013646.","journal-title":"Operations Research"},{"key":"CR37","first-page":"79","volume":"1","author":"J.J. Sylvester","year":"1857","unstructured":"J.J. Sylvester, \u201cA question in the geometry of the situation,\u201dQuarterly Journal of Pure and Applied Mathematics 1 (1857) 79.","journal-title":"Quarterly Journal of Pure and Applied Mathematics"},{"key":"CR38","volume-title":"Convex Functions","author":"D.E. Varberg","year":"1973","unstructured":"D.E. Varberg and A.W. Roberts,Convex Functions (Academic Press, New York, 1973)."},{"key":"CR39","doi-asserted-by":"crossref","first-page":"1074","DOI":"10.1287\/opre.33.5.1074","volume":"33","author":"J.E. Ward","year":"1985","unstructured":"J.E. Ward and R.E. Wendell, \u201cUsing blocks norms for location modelling,\u201dOperations Research 33 (1985) 1074\u20131090.","journal-title":"Operations Research"},{"key":"CR40","unstructured":"A. Weber, \u201cUber den standort der industrien,\u201d (1909)."},{"key":"CR41","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(87)90016-2","volume":"6","author":"Y. Ye","year":"1987","unstructured":"Y. Ye, \u201cKarmarkar's algorithm and the ellipsoid method,\u201dOperations Research Letters 6 (1987) 177\u2013182.","journal-title":"Operations Research Letters"},{"key":"CR42","first-page":"128","volume":"12","author":"D.B. Yudin","year":"1976","unstructured":"D.B. Yudin and A.S. Nemirovsky, \u201cEvaluation of the informational complexity of mathematical programming problems,\u201dEkonomika i Matematicheskie Metody 12 (1976) 128\u2013142 [In Russian.]","journal-title":"Ekonomika i Matematicheskie Metody"},{"key":"CR43","first-page":"357","volume":"12","author":"D.B. Yudin","year":"1976","unstructured":"D.B. Yudin and A.S. Nemirovsky,\u201d Informational complexity and efficient methods for the solution of convex extremal problems,\u201dEkonomika i Matematicheskie Metody 12 (1976) 357\u2013369 [In Russian.]","journal-title":"Ekonomika i Matematicheskie Metody"},{"key":"CR44","unstructured":"S. Zhang, \u201cStochastic queue location problems,\u201d PhD thesis, Tinbergen Institute Series 14 (Rotterdam, The Netherlands, 1991)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582060.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01582060\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01582060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T08:17:44Z","timestamp":1706170664000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01582060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,1]]},"references-count":44,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1994,1]]}},"alternative-id":["BF01582060"],"URL":"https:\/\/doi.org\/10.1007\/bf01582060","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,1]]}}}