{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,7]],"date-time":"2025-07-07T09:26:24Z","timestamp":1751880384227},"reference-count":43,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1989,11,1]],"date-time":"1989-11-01T00:00:00Z","timestamp":625881600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8659,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1989,11]]},"DOI":"10.1016\/0166-218x(89)90002-4","type":"journal-article","created":{"date-parts":[[2002,9,17]],"date-time":"2002-09-17T12:34:42Z","timestamp":1032266082000},"page":"211-239","source":"Crossref","is-referenced-by-count":14,"title":["The steepest descent gravitational method for linear programming"],"prefix":"10.1016","volume":"25","author":[{"given":"Soo Y.","family":"Chang","sequence":"first","affiliation":[]},{"given":"Katta G.","family":"Murty","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(89)90002-4_BIB1","series-title":"Tech. Rept. ORC 86-8","article-title":"An implementation of Karmarkar's algorithm for linear programming","author":"Adler","year":"1986"},{"key":"10.1016\/0166-218X(89)90002-4_BIB2","series-title":"Linear programming and the Newton barrier flow","author":"Anstreicher","year":"1987"},{"key":"10.1016\/0166-218X(89)90002-4_BIB3","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/BF02592024","article-title":"A variation of Karmarkar's algorithm for solving linear programming problems","volume":"36","author":"Barnes","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90002-4_BIB4","series-title":"Linear Programming: Active Set Analysis and Computer Programs","author":"Best","year":"1985"},{"key":"10.1016\/0166-218X(89)90002-4_BIB5","series-title":"Simplex method and Karmarkar's algorithm: A unifying structure","author":"Chiu","year":"1985"},{"key":"10.1016\/0166-218X(89)90002-4_BIB6","first-page":"439","article-title":"Polynomial bounded ellipsoid algorithm for convex quadratic programming","volume":"4","author":"Chung","year":"1981"},{"key":"10.1016\/0166-218X(89)90002-4_BIB7","series-title":"Linear Programming and Extensions","author":"Dantzig","year":"1963"},{"key":"10.1016\/0166-218X(89)90002-4_BIB8","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF01588254","article-title":"Computational complexity of LCP's associated with positive definite symmetric matrices","volume":"17","author":"Fathi","year":"1979","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90002-4_BIB9","series-title":"Tech. Rept. 80-4","article-title":"Comparative study of the ellipsoid algorithm and other algorithms for the nearest point problem","author":"Fathi","year":"1980"},{"key":"10.1016\/0166-218X(89)90002-4_BIB10","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/BF01840456","article-title":"A polynomial Newton method for linear programming","volume":"1","author":"de Ghellinck","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(89)90002-4_BIB11","series-title":"A fast procedure for computing the distances between complex objects in three space","author":"Gilbert","year":"1986"},{"key":"10.1016\/0166-218X(89)90002-4_BIB12","series-title":"Tech. Rept. SOL85-11R","article-title":"On projected Newton barrier methods for linear programming and an equivalence to Karmarkar's projective method","author":"Gill","year":"1986"},{"key":"10.1016\/0166-218X(89)90002-4_BIB13","series-title":"Tech. Rept. SOL86-7","article-title":"A note on nonlinear approaches to linear programming","author":"Gill","year":"1986"},{"key":"10.1016\/0166-218X(89)90002-4_BIB14","series-title":"Tech. Rept. SOL81-16","article-title":"Variable metric relaxation methods, Part I: A conceptual algorithm","author":"Goffin","year":"1981"},{"key":"10.1016\/0166-218X(89)90002-4_BIB15","series-title":"An algorithm for solving linear programming problems in O(n3L) operations","author":"Gonzaga","year":"1987"},{"key":"10.1016\/0166-218X(89)90002-4_BIB16","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A new polynomial-time algorithm for linear programming","volume":"4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/0166-218X(89)90002-4_BIB17","series-title":"Tech. Rept. B-188","article-title":"A primal-dual interior point algorithm for linear programming","author":"Kojima","year":"1987"},{"key":"10.1016\/0166-218X(89)90002-4_BIB18","series-title":"Nonlinear Programming","author":"Mangasarian","year":"1969"},{"key":"10.1016\/0166-218X(89)90002-4_BIB19","series-title":"Recent breakthroughs in linear programming methods","author":"Monma","year":"1987"},{"key":"10.1016\/0166-218X(89)90002-4_BIB20","series-title":"Computational experience with a dual affine variant of Karmarkar's method for linear programming","author":"Monma","year":"1987"},{"key":"10.1016\/0166-218X(89)90002-4_BIB21","series-title":"Rept. SOL83-20","article-title":"MINOS 5.0 user's guide","author":"Murtagh","year":"1983"},{"key":"10.1016\/0166-218X(89)90002-4_BIB22","series-title":"Linear and Combinatorial Programming","author":"Murty","year":"1976"},{"key":"10.1016\/0166-218X(89)90002-4_BIB23","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/BF01583789","article-title":"A critical index algorithm for nearest point problems on simplicial cones","volume":"23","author":"Murty","year":"1982","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90002-4_BIB24","series-title":"Linear Programming","author":"Murty","year":"1983"},{"key":"10.1016\/0166-218X(89)90002-4_BIB25","first-page":"206","article-title":"The gravitational method for linear programming","volume":"23","author":"Murty","year":"1986","journal-title":"OpSearch"},{"key":"10.1016\/0166-218X(89)90002-4_BIB26","series-title":"Linear Complementarity, Linear and Nonlinear Programming","author":"Murty","year":"1988"},{"key":"10.1016\/0166-218X(89)90002-4_BIB27","series-title":"Tech. Rept. MSRI 07118-86","article-title":"A polynomial-time algorithm, based on Newton's method, for linear programming","author":"Renegar","year":"1986"},{"key":"10.1016\/0166-218X(89)90002-4_BIB28","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0108011","article-title":"The gradient projection method for nonlinear programming, Part I: Linear constraints","volume":"8","author":"Rosen","year":"1960","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(89)90002-4_BIB29","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1137\/0109044","article-title":"The gradient projection method for nonlinear programming, Part II: Nonlinear constraints","volume":"9","author":"Rosen","year":"1961","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(89)90002-4_BIB30","series-title":"A dual interior primal simplex method for linear programming","author":"Tamura","year":"1987"},{"key":"10.1016\/0166-218X(89)90002-4_BIB31","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1007\/BF01840455","article-title":"An extension of Karmarkar's algorithm for linear programming using dual variables","volume":"1","author":"Todd","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(89)90002-4_BIB32","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1007\/BF01840454","article-title":"A modification of Karmarkar's linear programming algorithm","volume":"1","author":"Vanderbei","year":"1986","journal-title":"Algorithmica"},{"key":"10.1016\/0166-218X(89)90002-4_BIB33","first-page":"48","article-title":"A nearest point algorithm for convex polyhedral cones and applications to positive linear approximation","volume":"30","author":"Wilhelmsen","year":"1976","journal-title":"Math. Comp."},{"key":"10.1016\/0166-218X(89)90002-4_BIB34","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1007\/BFb0121249","article-title":"Algorithm for a least distance programming problem","volume":"1","author":"Wolfe","year":"1974","journal-title":"Math. Programming Study"},{"key":"10.1016\/0166-218X(89)90002-4_BIB35","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1007\/BF01580381","article-title":"Finding the nearest point in a polytope","volume":"11","author":"Wolfe","year":"1976","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90002-4_BIB36","series-title":"Barrier-projection in projective algorithm for linear programming","author":"Ye","year":"1985"},{"key":"10.1016\/0166-218X(89)90002-4_BIB37","series-title":"Cutting-objective and scaling method: \u2018Simple\u2019 polynomial algorithm for linear programming","author":"Ye","year":"1985"},{"key":"10.1016\/0166-218X(89)90002-4_BIB38","series-title":"A polynomial-time algorithm for convex quadratic programming","author":"Ye","year":"1986"},{"issue":"4","key":"10.1016\/0166-218X(89)90002-4_BIB39","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0167-6377(87)90016-2","article-title":"Karmarkar's algorithm and the ellipsoid method","volume":"6","author":"Ye","year":"1987","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0166-218X(89)90002-4_BIB40","series-title":"Tech. Rept. SOL87-6","article-title":"The box method for linear programming: Part I: Basic theory","author":"Zikan","year":"1987"},{"key":"10.1016\/0166-218X(89)90002-4_BIB41","series-title":"Methods of Feasible Directions: A Study in Linear and Nonlinear Programming","author":"Zoutendijk","year":"1960"},{"key":"10.1016\/0166-218X(89)90002-4_BIB42","series-title":"Nonlinear Programming","first-page":"93","article-title":"Some algorithms based upon the principle of feasible directions","author":"Zoutendijk","year":"1970"},{"key":"10.1016\/0166-218X(89)90002-4_BIB43","series-title":"Mathematical Programming Methods","author":"Zoutendijk","year":"1976"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900024?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900024?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,9]],"date-time":"2019-04-09T13:22:52Z","timestamp":1554816172000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X89900024"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,11]]},"references-count":43,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1989,11]]}},"alternative-id":["0166218X89900024"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(89)90002-4","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,11]]}}}