{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,5,5]],"date-time":"2024-05-05T02:36:19Z","timestamp":1714876579533},"reference-count":23,"publisher":"Elsevier","isbn-type":[{"value":"9780080408064","type":"print"}],"license":[{"start":{"date-parts":[[1992,1,1]],"date-time":"1992-01-01T00:00:00Z","timestamp":694224000000},"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":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1016\/b978-0-08-040806-4.50010-1","type":"book-chapter","created":{"date-parts":[[2014,7,1]],"date-time":"2014-07-01T17:16:02Z","timestamp":1404234962000},"page":"73-86","source":"Crossref","is-referenced-by-count":0,"title":["ADAPTING THE INTERIOR POINT METHOD FOR THE SOLUTION OF LINEAR PROGRAMS ON HIGH PERFORMANCE COMPUTERS"],"prefix":"10.1016","author":[{"given":"J.","family":"ANDERSEN","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"LEVKOVITZ","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"MITRA","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib1","unstructured":"Andersen J, Levkovitz R, Mitra G and Tamiz M (1990). Adapting IPM for the solution of LPs on Serial, Coarse Grain Parallel and Massively Parallel Computers, Brunei University, Department of Mathematics and Statistics TR01\/90."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib2","unstructured":"Amdahl G.M. (1967). Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities, AFIPS Conference Proceedings, Vol. 20, 483\u2013485."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib3","unstructured":"Andersen J, Mitra G and Parkinson D (1991). The Scheduling of Sparse Matrix-Vector Multiplication on a Massively Parallel DAP Computer, Brunei University, Department of Mathematics TR09\/91 presented to ICIAM Congress Washington, 91, to appear in Parallel Computing."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib4","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1177\/109434208700100403","article-title":"Progress in Sparse Matrix Methods for Large Linear Systems on Vector Supercomputers","volume":"Vol 1","author":"Ashcroft","year":"1987","journal-title":"International Journal of Supercomputer Applications"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib5","unstructured":"Bixby R.E (1991). The Simplex Method - It Keeps Getting Better, Presented to the 14th International MPS Symposium, Holland."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib6","series-title":"Very Large Scale Linear Programming: A Case Study in Combining Interior Point and Simplex Methods","author":"Bixby","year":"1991"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib7","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0167-8191(90)90150-8","article-title":"Data Mapping of Linear Programming on Fixed Size Hypercubes","volume":"13","author":"Chen","year":"1990","journal-title":"Parallel Computing"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib8","series-title":"Direct Methods for Sparse Matrices","author":"Duff","year":"1986"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib9","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/BF02023049","article-title":"Vector Processing in Simplex and Interior Methods for Linear Programming","volume":"22","author":"Forrest","year":"1990","journal-title":"Annals of OR"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib10","first-page":"10","article-title":"Electronic Mail Distribution of Linear Programming Test Problems","volume":"Vol 13","author":"Gay","year":"1985","journal-title":"COAL Newsletter MP Society"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib11","series-title":"Computer Solution of Large Sparse Positive Definite Systems","author":"George","year":"1981"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib12","series-title":"Matrix Computation","author":"Golub","year":"1983"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","article-title":"A New Polynomial Time Algorithm for Linear Programming","volume":"Vol 4","author":"Karmarkar","year":"1984","journal-title":"Combinatorica"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib14","first-page":"147","article-title":"Preconditioned Conjugate Gradient Methods on the DAP","volume":"Vol 4","author":"Lai","year":"1988","journal-title":"Proceedings of The Mathematics Of Finite Elements & Applications"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib15","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0167-8191(89)90064-1","article-title":"Reordering Sparse Matrices for Parallel Elimination","volume":"Vol 11","author":"Liu","year":"1989","journal-title":"Parallel Computing"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib16","unstructured":"Lustig I.J, Marsten E.R, Shanno D.F. (1990). On Implementing Mehrotra's Predictor-Corrector Interior Point Method for Linear Programming, Technical Report SOR 90\u201303, Department of Civil Engineering and Operational Research, Princeton University."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib17","unstructured":"Lustig I.J, Marsten R.E, Shanno D.F. (1991). The Interaction of Algorithms and Architectures for Interior Point Methods, Research Reports, RUTCOR"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib18","article-title":"On Finding Primal-Dual and Dual-Optimal Bases","volume":"Vol 2","author":"Megiddo","year":"1991","journal-title":"ORSA Journal on Computing"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib19","unstructured":"Mitra G, Tamiz M. (1991). Alternative Methods for Representing the Inverse of Linear Programming Basis Matrices, in, Recent Developments in Mathematical Programming, ASOR special issue, Edited by S. Kumar, Gordon-Breach."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib20","article-title":"Interior Path Following Primal-Dual Algorithm","volume":"Vol 44","author":"Monteiro","year":"1989","journal-title":"Mathematical Programming"},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib21","unstructured":"Mitra G, Levkovitz R, Tamiz M. (1991). Integration of IPM Within Simplex, Experiments in Feasible Basis Recovery, Brunei University, Presented to 14th MPS Symposium Holland."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib22","unstructured":"Pardalos P.M, Phillips A.T, Rosen J.B. (1990). Topics in Parallel Computing in Mathematical Programming, Report CS-90\u201322, Department of Computer Science, Pennsylvania State University. Also in SIAM frontiers in Applied Mathematics."},{"key":"10.1016\/B978-0-08-040806-4.50010-1_bib23","doi-asserted-by":"crossref","unstructured":"Stunkel C.B, Reed D.A. (1988). Hypercube Implementation of the Simplex Algorithm, Proceedings on Hypercube Concurrent Computers and Applications, IAACM Publication, 1473\u20131482.","DOI":"10.1145\/63047.63104"}],"container-title":["Computer Science and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080408064500101?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:B9780080408064500101?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T08:36:15Z","timestamp":1565598975000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/B9780080408064500101"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9780080408064"],"references-count":23,"URL":"https:\/\/doi.org\/10.1016\/b978-0-08-040806-4.50010-1","relation":{},"subject":[],"published":{"date-parts":[[1992]]}}}