{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T18:12:54Z","timestamp":1649182374425},"reference-count":14,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1996,1,1]],"date-time":"1996-01-01T00:00:00Z","timestamp":820454400000},"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":["Computers & Operations Research"],"published-print":{"date-parts":[[1996,1]]},"DOI":"10.1016\/0305-0548(95)00010-j","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:00:05Z","timestamp":1027652405000},"page":"13-25","source":"Crossref","is-referenced-by-count":3,"title":["A method of euclidean centers"],"prefix":"10.1016","volume":"23","author":[{"given":"James T.","family":"Fagan","sequence":"first","affiliation":[]},{"given":"James E.","family":"Falk","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0305-0548(95)00010-J_BIB1","doi-asserted-by":"crossref","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming. Combinatorica 4, 373\u2013395.","DOI":"10.1007\/BF02579150"},{"key":"10.1016\/0305-0548(95)00010-J_BIB2","series-title":"History of Mathematical Programming\u2014A Collection of Personal Reminiscences","article-title":"Linear programming","author":"Dantzig","year":"1991"},{"key":"10.1016\/0305-0548(95)00010-J_BIB3","doi-asserted-by":"crossref","DOI":"10.1017\/S0962492900002300","article-title":"Interior methods for constrained optimization","volume":"1","author":"Wright","year":"1992","journal-title":"Acta Numer."},{"key":"10.1016\/0305-0548(95)00010-J_BIB4","unstructured":"A. V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques. Wiley, New York. Republished by SIAM, Philadelphia."},{"key":"10.1016\/0305-0548(95)00010-J_BIB5","unstructured":"P. Huard, Resolution of mathematical programming with non-linear constraints by the method of centers. In Nonlinear Programming (J. Abadie, Ed.). North Holland, Amsterdam."},{"key":"10.1016\/0305-0548(95)00010-J_BIB6","unstructured":"G. P. McCormick, Nonlinear Programming: Theory, Algorithms, and Applications. Wiley, New York."},{"key":"10.1016\/0305-0548(95)00010-J_BIB7","article-title":"A method of Euclidean centers for linear programming","author":"Fagan","year":"1992"},{"key":"10.1016\/0305-0548(95)00010-J_BIB8","unstructured":"R. T. Rockafellar, Convex Analysis. Princeton University Press, Princeton."},{"key":"10.1016\/0305-0548(95)00010-J_BIB9","unstructured":"M. R. Osborne, Finite Algorithms in Optimization and Data Analysis. Wiley, New York."},{"key":"10.1016\/0305-0548(95)00010-J_BIB10","series-title":"Optimization by Vector Space Methods","author":"Luenberger","year":"1969"},{"key":"10.1016\/0305-0548(95)00010-J_BIB11","unstructured":"S. Karlin, Mathematical Methods and Theory in Games, Programming and Economics. Addison-Wesley, Reading, MA."},{"key":"10.1016\/0305-0548(95)00010-J_BIB12","doi-asserted-by":"crossref","unstructured":"H. D. Sherali and G. Choi, Finding the closest point to the origin in the convex hull of a discrete set of points. Computers Opers Res. 4, 363\u2013370.","DOI":"10.1016\/0305-0548(93)90080-3"},{"key":"10.1016\/0305-0548(95)00010-J_BIB13","doi-asserted-by":"crossref","unstructured":"P. Wolfe, The simplex method for quadratic programming. Econometrica 27, 382\u2013398.","DOI":"10.2307\/1909468"},{"key":"10.1016\/0305-0548(95)00010-J_BIB14","doi-asserted-by":"crossref","unstructured":"V. Klee, Polytope pairs and relationships to linear programming. Acta Mathematica 133, 1\u201325.","DOI":"10.1007\/BF02392139"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489500010J?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:030505489500010J?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,2,5]],"date-time":"2020-02-05T06:26:30Z","timestamp":1580883990000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/030505489500010J"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":14,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["030505489500010J"],"URL":"https:\/\/doi.org\/10.1016\/0305-0548(95)00010-j","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}