{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T07:46:35Z","timestamp":1759131995008},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Ann Oper Res"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1007\/bf02024486","type":"journal-article","created":{"date-parts":[[2005,8,5]],"date-time":"2005-08-05T19:52:41Z","timestamp":1123271561000},"page":"49-86","source":"Crossref","is-referenced-by-count":8,"title":["A parallel interior point algorithm for linear programming on a network of transputers"],"prefix":"10.1007","volume":"43","author":[{"given":"R. H.","family":"Bisseling","sequence":"first","affiliation":[]},{"given":"T. M.","family":"Doup","sequence":"additional","affiliation":[]},{"given":"L. D. J. C.","family":"Loyens","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"BF02024486_CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1.2.84","volume":"1","author":"I. Adler","year":"1989","unstructured":"I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, Data structures and programming techniques for the implementation of Karmarkar's algorithm, ORSA J. Comput. 1(1989)84\u2013106.","journal-title":"ORSA J. Comput."},{"key":"BF02024486_CR2","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/BF01587095","volume":"44","author":"I. Adler","year":"1989","unstructured":"I. Adler, M.G.C. Resende, G. Veiga and N. Karmarkar, An implementation of Karmarkar's algorithm for linear programming, Math. Progr. 44(1989)297\u2013335.","journal-title":"Math. Progr."},{"key":"BF02024486_CR3","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1142\/S0129053389000056","volume":"1","author":"E. Anderson","year":"1989","unstructured":"E. Anderson and Y. Saad, Solving sparse triangular linear systems on parallel computers, Int. J. High Speed Comput. 1(1989)73\u201395.","journal-title":"Int. J. High Speed Comput."},{"key":"BF02024486_CR4","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1137\/0911033","volume":"11","author":"C. Ashcraft","year":"1990","unstructured":"C. Ashcraft, S.C. Eisenstat and J.W.H. Liu, A fan-in algorithm for distributed sparse numerical factorization, SIAM J. Sci. Stat. Comput. 11(1990)593\u2013599.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02024486_CR5","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA228143","volume-title":"A comparison of three column-based distributed sparse factorization schemes","author":"C. Ashcraft","year":"1990","unstructured":"C. Ashcraft, S.C. Eisenstat, J.W.H. Liu and A.H. Sherman, A comparison of three column-based distributed sparse factorization schemes, Technical Report CS-90-09, Dept. of Computer Science, York University, North York, Ontario, Canada (1990)."},{"key":"BF02024486_CR6","first-page":"61","volume-title":"Lecture Notes in Computer Science 384","author":"R.H. Bisseling","year":"1989","unstructured":"R.H. Bisseling and J.G.G. van de Vorst, Parallel LU decomposition on a transputer network, in:Lecture Notes in Computer Science 384 (Springer, Berlin, 1989) pp. 61\u201377."},{"key":"BF02024486_CR7","doi-asserted-by":"crossref","first-page":"787","DOI":"10.1137\/0912041","volume":"12","author":"R.H. Bisseling","year":"1991","unstructured":"R.H. Bisseling and J.G.G. van de Vorst, Parallel triangular system solving on a mesh network of transputers, SIAM J. Sci. Stat. Comput. 12(1991)787\u2013799.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02024486_CR8","volume-title":"Direct Methods for Sparse Matrices","author":"I.S. Duff","year":"1986","unstructured":"I.S. Duff, A.M. Erisman and J.K. Reid,Direct Methods for Sparse Matrices (Oxford University Press, Oxford, UK, 1986)."},{"key":"BF02024486_CR9","volume-title":"Solving Problems on Concurrent Processors, Vol. 1","author":"G.C. Fox","year":"1988","unstructured":"G.C. Fox, M.A. Johnson, G.A. Lyzenga, S.W. Otto, J.K. Salmon and D.W. Walker,Solving Problems on Concurrent Processors, Vol. 1 (Prentice-Hall, Englewood Cliffs, NJ, 1988)."},{"key":"BF02024486_CR10","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, Electronic mail distribution of linear programming test problems, Math. Progr. Soc. COAL Newsl. 13(Dec. 1985)10\u201312.","journal-title":"Math. Progr. Soc. COAL Newsl."},{"key":"BF02024486_CR11","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1137\/0710032","volume":"10","author":"A. George","year":"1973","unstructured":"A. George, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal. 10(1973)345\u2013363.","journal-title":"SIAM J. Numer. Anal."},{"key":"BF02024486_CR12","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1137\/0909021","volume":"9","author":"A. George","year":"1988","unstructured":"A. George, M.T. Heath, J. Liu and E. Ng, Sparse Cholesky factorization on a local-memory multiprocessor, SIAM J. Sci. Stat. Comput. 9(1988)327\u2013340.","journal-title":"SIAM J. Sci. Stat. Comput."},{"key":"BF02024486_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1031001","volume":"31","author":"A. George","year":"1989","unstructured":"A. George and J.W.H. Liu, The evolution of the minimum degree ordering algorithm, SIAM Rev. 31(1989)1\u201319.","journal-title":"SIAM Rev."},{"key":"BF02024486_CR14","series-title":"Technical Report","volume-title":"A note on nonlinear approaches to linear programming","author":"P.E. Gill","year":"1986","unstructured":"P.E. Gill, W. Murray, M.A. Saunders and M.H. Wright, A note on nonlinear approaches to linear programming, Technical Report SOL 86-7, Department of Operations Research, Standford University, Stanford, CA (1986)."},{"key":"BF02024486_CR15","volume-title":"Matrix Computations","author":"G.H. Golub","year":"1989","unstructured":"G.H. Golub and C.F. Van Loan,Matrix Computations, 2nd ed. (The Johns Hopkins University Press, Baltimore, MD, 1989).","edition":"2nd ed"},{"key":"BF02024486_CR16","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1137\/1033099","volume":"33","author":"M.T. Heath","year":"1991","unstructured":"M.T. Heath, E. Ng and B.W. Peyton, Parallel algorithms for sparse linear systems, SIAM Rev. 33(1991)420\u2013460.","journal-title":"SIAM Rev."},{"key":"BF02024486_CR17","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/BF02186472","volume":"14","author":"R.V. Helgason","year":"1988","unstructured":"R.V. Helgason, J.L. Kennington and H.A. Zaki, A parallelization of the Simplex method, Ann. Oper. Res. 14(1988)17\u201340.","journal-title":"Ann. Oper. Res."},{"key":"BF02024486_CR18","volume-title":"occam 2 Reference Manual","author":"Inmos Ltd","year":"1988","unstructured":"Inmos Ltd.,occam 2 Reference Manual (Prentice-Hall, Hemel Hempstead, UK, 1988)."},{"key":"BF02024486_CR19","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0743-7315(87)90002-5","volume":"4","author":"S.L. Johnsson","year":"1987","unstructured":"S.L. Johnsson, Communication efficient basic linear algebra computations on hypercube architectures, J. Parallel Distr. Comput. 4(1987)133\u2013172.","journal-title":"J. Parallel Distr. Comput."},{"key":"BF02024486_CR20","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1007\/BF02579150","volume":"4","author":"N. Karmarkar","year":"1984","unstructured":"N. Karmarkar, A new polynomial-time algorithm for linear programming, Combinatorica 4(1984)373\u2013395.","journal-title":"Combinatorica"},{"key":"BF02024486_CR21","volume-title":"The Art of Computer Programming, Vol. 1","author":"D.E. Knuth","year":"1973","unstructured":"D.E. Knuth,The Art of Computer Programming, Vol. 1, 2nd ed. (Addison-Wesley, Reading, MA, 1973).","edition":"2nd ed."},{"key":"BF02024486_CR22","first-page":"29","volume-title":"Progress in Mathematical Programming","author":"M. Kojima","year":"1988","unstructured":"M. Kojima, S. Mizuno and A. Yoshise, A Primal-Dual Interior Point algorithm for linear programming, in: N. Megiddo (ed.),Progress in Mathematical Programming, (Springer, New York, 1988) pp. 29\u201347."},{"key":"BF02024486_CR23","first-page":"105","volume-title":"Proc. 3rd Int. Conf. on Applications of Transputers","author":"R. Levkovitz","year":"1991","unstructured":"R. Levkovitz and G. Mitra, Solution of large sparse symmetric equations on a transputer network, in:Proc. 3rd Int. Conf. on Applications of Transputers, T.S. Durrani et al. (eds.), (IOS Press, Amsterdam, 1991) pp. 105\u2013110."},{"key":"BF02024486_CR24","first-page":"30","volume-title":"Transputing in Numerical and Neural Network Applications","author":"R. Levkovitz","year":"1992","unstructured":"R. Levkovitz and G. Mitra, Cholesky factorization of sparse symmetric positive definite matrices on distributed parallel computers, in:Transputing in Numerical and Neural Network Applications, ed. G.L. Reijns and J. Luo (IOS Press, Amsterdam, 1992) pp. 30\u201347."},{"key":"BF02024486_CR25","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1145\/214392.214398","volume":"11","author":"J.W.H. Liu","year":"1985","unstructured":"J.W.H. Liu, Modification of the minimum-degree algorithm by multiple elimination, ACM Trans. Math. Softw. 11(1985)141\u2013153.","journal-title":"ACM Trans. Math. Softw."},{"key":"BF02024486_CR26","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1145\/6497.6499","volume":"12","author":"J.W.H. Liu","year":"1986","unstructured":"J.W.H. Liu, A compact row storage scheme for Cholesky factors using elimination trees, ACM Trans. Math. Softw. 12(1986)127\u2013148.","journal-title":"ACM Trans. Math. Softw."},{"key":"BF02024486_CR27","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1137\/0611010","volume":"11","author":"J.W.H. Liu","year":"1990","unstructured":"J.W.H. Liu, The role of elimination trees in sparse factorization, SIAM J. Matrix Anal. Appl. 11(1990)134\u2013172.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"BF02024486_CR28","volume-title":"A design method for parallel programs","author":"L.D.J.C. Loyens","year":"1992","unstructured":"L.D.J.C. Loyens, A design method for parallel programs, Ph.D. Thesis, Dept. of Mathematics and Computing Science, Edindhoven University of Technology, The Netherlands (1992)."},{"key":"BF02024486_CR29","first-page":"325","volume-title":"Lecture Notes in Computer Science 375","author":"L.D.J.C. Loyens","year":"1989","unstructured":"L.D.J.C. Loyens and R.H. Bisseling, The formal construction of a parallel triangular system solver, in:Lecture Notes in Computer Science 375 (Springer, Berlin, 1989) pp. 325\u2013334."},{"key":"BF02024486_CR30","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0024-3795(91)90275-2","volume":"152","author":"I.J. Lustig","year":"1991","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, Computational experience with a Primal-Dual Interior Point method for linear programming, Lin. Alg. Appl. 152(1991)191\u2013222.","journal-title":"Lin. Alg. Appl."},{"key":"BF02024486_CR31","doi-asserted-by":"crossref","first-page":"435","DOI":"10.1137\/0802022","volume":"2","author":"I.J. Lustig","year":"1992","unstructured":"I.J. Lustig, R.E. Marsten and D.F. Shanno, On implementing Mehrotra's predictor-corrector Interior-Point method for linear programming, SIAM J. Optim. 2(1992)435\u2013449.","journal-title":"SIAM J. Optim."},{"key":"BF02024486_CR32","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1287\/ijoc.1.4.287","volume":"1","author":"R.E. Marsten","year":"1989","unstructured":"R.E. Marsten, M.J. Saltzman, D.F. Shanno, G.S. Pierce and J.F. Ballintijn, Implementation of a Dual Affine Interior Point algorithm for linear programming, ORSA J. Comput. 1(1989)287\u2013297.","journal-title":"ORSA J. Comput."},{"key":"BF02024486_CR33","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1287\/inte.20.4.105","volume":"20","author":"R. Marsten","year":"1990","unstructured":"R. Marsten, R. Subramanian, M. Saltzman, I. Lustig and D. Shanno, Interior Point methods for linear programming: Just call Newton, Lagrange, and Fiacco and McCormick!, Interfaces 20(1990)105\u2013116.","journal-title":"Interfaces"},{"key":"BF02024486_CR34","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1137\/0802028","volume":"2","author":"S. Mehrotra","year":"1992","unstructured":"S. Mehrotra, On the implementation of a Primal-Dual Interior Point method, SIAM J. Optim. 2(1992)575\u2013601.","journal-title":"SIAM J. Optim."},{"key":"BF02024486_CR35","doi-asserted-by":"crossref","first-page":"840","DOI":"10.1145\/4021.4025","volume":"28","author":"D.P. O'Leary","year":"1985","unstructured":"D.P. O'Leary and G.W. Stewart, Data-flow algorithms for parallel matrix computations, Commun. ACM 28(1985)840\u2013853.","journal-title":"Commun. ACM"},{"key":"BF02024486_CR36","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1145\/356004.356006","volume":"8","author":"R. Schreiber","year":"1982","unstructured":"R. Schreiber, A new implementation of sparse Gaussian elimination, ACM Trans. Math. Softw. 8(1982)256\u2013276.","journal-title":"ACM Trans. Math. Softw."},{"key":"BF02024486_CR37","doi-asserted-by":"crossref","first-page":"853","DOI":"10.1137\/0614059","volume":"14","author":"A.F. Stappen van der","year":"1993","unstructured":"A.F. van der Stappen, R.H. Bisseling and J.G.G. van de Vorst, Parallel sparse LU decomposition on a mesh network of transputers, SIAM J. Matrix Anal. Appl. 14(1993)853\u2013879.","journal-title":"SIAM J. Matrix Anal. Appl."},{"key":"BF02024486_CR38","first-page":"1473","volume-title":"Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications, Vol. 2","author":"C.B. Stunkel","year":"1988","unstructured":"C.B. Stunkel and D.A. Reed, Hypercube implementation of the Simplex algorithm, in:Proc. 3rd Conf. on Hypercube Concurrent Computers and Applications, Vol. 2, G. Fox (ed.) ACM Press, New York, 1988) pp. 1473\u20131482."},{"key":"BF02024486_CR39","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/BFb0121187","volume":"31","author":"J.A. Tomlin","year":"1987","unstructured":"J.A. Tomlin, An experimental approach to Karmarkar's projective method for linear programming, Math. Progr. Study 31(1987)175\u2013191.","journal-title":"Math. Progr. Study"},{"key":"BF02024486_CR40","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02915443","volume":"26","author":"J.G.G. Vorst van de","year":"1988","unstructured":"J.G.G. van de Vorst, The formal development of a parallel program performing LU-decomposition, Acta Inform. 26(1988)1\u201317.","journal-title":"Acta Inform."},{"key":"BF02024486_CR41","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0167-739X(89)90006-X","volume":"4","author":"J.G.G. Vorst van de","year":"1989","unstructured":"J.G.G. van de Vorst, Solving the least squares problem using a parallel linear algebra library, Future Generation Comp. Syst. 4(1989)293\u2013297.","journal-title":"Future Generation Comp. Syst."},{"key":"BF02024486_CR42","first-page":"112","volume-title":"Logistics: where ends have to meet","author":"J.G.G. Vorst van de","year":"1989","unstructured":"J.G.G. van de Vorst, An attempt to use parallel computing in large scale optimisation, in:Logistics: where ends have to meet, C.F.H. van Rijn (ed.) (Pergamon Press, Oxford, UK, 1989) pp. 112\u2013119."}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02024486.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02024486\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02024486","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T22:42:40Z","timestamp":1557787360000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02024486"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":42,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["BF02024486"],"URL":"https:\/\/doi.org\/10.1007\/bf02024486","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"value":"0254-5330","type":"print"},{"value":"1572-9338","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}