{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,8]],"date-time":"2024-08-08T09:13:24Z","timestamp":1723108404481},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1992,8,1]],"date-time":"1992-08-01T00:00:00Z","timestamp":712627200000},"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":[[1992,8]]},"DOI":"10.1007\/bf01580890","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T08:58:11Z","timestamp":1114678691000},"page":"1-30","source":"Crossref","is-referenced-by-count":15,"title":["A hierarchical algorithm for making sparse matrices sparser"],"prefix":"10.1007","volume":"56","author":[{"given":"S. Frank","family":"Chang","sequence":"first","affiliation":[]},{"given":"S. Thomas","family":"McCormick","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1287\/ijoc.1.2.84","volume":"1","author":"I. Adler","year":"1987","unstructured":"I. Adler, N. Karmarkar, M.G.C. Resende and G. Veiga, \u201cData structures and programming techniques for the implementation of Karmarkar's Algorithm,\u201dORSA Journal on Computing 1 (1987) 84\u2013106.","journal-title":"ORSA Journal on Computing"},{"key":"CR2","volume-title":"The Design and Analysis of Computer Algorithms","author":"A.V. Aho","year":"1979","unstructured":"A.V. Aho, J.E. Hopcroft and J.D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1979)."},{"key":"CR3","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1007\/BF01580428","volume":"8","author":"A.L. Brearley","year":"1975","unstructured":"A.L. Brearley, G. Mitra and H.P. Williams, \u201cAnalysis of mathematical programming problems prior to applying the Simplex Algorithm,\u201dMathematical Programming 8 (1975) 54\u201383.","journal-title":"Mathematical Programming"},{"key":"CR4","volume-title":"Increasing sparsity in matrices for large scale optimization \u2014 theoretical properties and implementational aspects","author":"S.F. Chang","year":"1989","unstructured":"S.F. Chang, \u201cIncreasing sparsity in matrices for large scale optimization \u2014 theoretical properties and implementational aspects,\u201d Ph.D. Thesis, Columbia University (New York, 1989)."},{"key":"CR5","series-title":"Working Paper","volume-title":"A faster implementation of a bipartite cardinality matching algorithms","author":"S.F. Chang","year":"1990","unstructured":"S.F. Chang and S.T. McCormick, \u201cA faster implementation of a bipartite cardinality matching algorithms,\u201d Working Paper 90-MSC-005, Faculty of Commerce, University of British Columbia (Vancouver, BC, 1990a)."},{"key":"CR6","series-title":"Working Paper","volume-title":"Implementation and computational results for the Hierarchical Algorithm for making sparse matrices sparser","author":"S.F. Chang","year":"1990","unstructured":"S.F. Chang and S.T. McCormick, \u201cImplementation and computational results for the Hierarchical Algorithm for making sparse matrices sparser,\u201d Working Paper 90-MSC-013, Faculty of Commerce, University of British Columbia (Vancouver, BC, 1990b)."},{"key":"CR7","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-12914-6","volume-title":"Large Sparse Numerical Optimization, Lecture Notes in Computer Science No. 165","author":"T.F. Coleman","year":"1984","unstructured":"T.F. Coleman,Large Sparse Numerical Optimization, Lecture Notes in Computer Science No. 165 (Springer, Berlin 1984)."},{"key":"CR8","doi-asserted-by":"crossref","first-page":"182","DOI":"10.1016\/0024-3795(74)90066-4","volume":"8","author":"R.W. Cottle","year":"1974","unstructured":"R.W. Cottle, \u201cManifestations of the Schur complement,\u201dLinear Algebra and its Applications 8 (1974) 182\u2013211.","journal-title":"Linear Algebra and its Applications"},{"key":"CR9","volume-title":"\u201cMa28 \u2014 a set ofFortran subroutines for sparse unsymmetric linear equations,\u201d A.E.R.E. Harwell Report 8730","author":"I.S. Duff","year":"1977","unstructured":"I.S. Duff, \u201cMa28 \u2014 a set ofFortran subroutines for sparse unsymmetric linear equations,\u201d A.E.R.E. Harwell Report 8730 (Harwell, UK, 1977)."},{"key":"CR10","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1145\/355958.355963","volume":"7","author":"I.S. Duff","year":"1981","unstructured":"I.S. Duff, \u201cOn algorithms for obtaining a maximum transversal,\u201dACM Transactions on Mathematical Software 7 (1981) 315\u2013330.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR11","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 (Clarendon Press, Oxford, UK, 1986)."},{"key":"CR12","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1145\/44128.44131","volume":"14","author":"I.S. Duff","year":"1988","unstructured":"I.S. Duff and T. Wiberg, \u201cRemarks on implementations of O(n 1\/2 \u03c4) assignment algorithms,\u201dACM Transactions on Mathematical Software 14 (1988) 267\u2013287.","journal-title":"ACM Transactions on Mathematical Software"},{"key":"CR13","first-page":"10","volume":"13","author":"D.M. Gay","year":"1985","unstructured":"D.M. Gay, \u201cElectronic mail distribution of linear programming test problems,\u201dMathematical Programming Society Committee on Algorithms Newsletter 13 (1985) 10\u201312.","journal-title":"Mathematical Programming Society Committee on Algorithms Newsletter"},{"key":"CR14","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\u00e1sz and A. Schrijver, \u201cThe Ellipsoid Method and its consequences in combinatorial optimization,\u201dCombinatorica 1 (1981) 169\u2013197.","journal-title":"Combinatorica"},{"key":"CR15","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/B978-0-12-566780-7.50017-9","volume-title":"Progress in Combinatorial Optimization","author":"A.J. Hoffman","year":"1984","unstructured":"A.J. Hoffman and S.T. McCormick, \u201cA fast algorithm that makes matrices optimally sparse,\u201d in: W.R. Pulleyblank, ed.,Progress in Combinatorial Optimization (Academic Press, London and New York, 1984) pp. 185\u2013196."},{"key":"CR16","volume-title":"Combinatorial Optimization:Networks and Matroids","author":"E.L. Lawler","year":"1976","unstructured":"E.L. Lawler,Combinatorial Optimization:Networks and Matroids (Holt, Rinehart and Winston, New York, 1976)."},{"key":"CR17","volume-title":"Introduction to Combinatorial Mathematics","author":"C.L. Liu","year":"1972","unstructured":"C.L. Liu,Introduction to Combinatorial Mathematics (McCraw-Hill, New York, 1972)."},{"key":"CR18","doi-asserted-by":"crossref","DOI":"10.21236\/ADA131387","volume-title":"A combinatorial approach to some sparse matrix problems","author":"S.T. McCormick","year":"1983","unstructured":"S.T. McCormick \u201cA combinatorial approach to some sparse matrix problems,\u201d Ph.D. Thesis, Stanford University (Stanford, CA, 1983)."},{"key":"CR19","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF01588780","volume":"49","author":"S.T. McCormick","year":"1990","unstructured":"S.T. McCormick, \u201cMaking sparse matrices sparser: Computational results,\u201dMathematical Programming 49 (1990) 91\u2013111.","journal-title":"Mathematical Programming"},{"key":"CR20","series-title":"Working Paper","volume-title":"The weighted sparsity problem: Complexity and algorithms","author":"S.T. McCormick","year":"1990","unstructured":"S.T. McCormick and S.F. Chang, \u201cThe weighted sparsity problem: Complexity and algorithms,\u201d Working Paper 90-MCS-007, Faculty of Commerce, University of British Columbia (Vancouver, BC, 1990)."},{"key":"CR21","series-title":"Research Memorandum","volume-title":"Sparsity and block-triangularization","author":"K. Murota","year":"1987","unstructured":"K. Murota, \u201cSparsity and block-triangularization,\u201d Research Memorandum RMI 87-07, Department of Mathematical Engineering and Information Physics, University of Tokyo (Tokyo, Japan, 1987)."},{"key":"CR22","volume-title":"\u201cMINOS 5.0 user's guide,\u201d Technical Report SOL 83-20","author":"B.A. Murtagh","year":"1983","unstructured":"B.A. Murtagh and M.A. Saunders, \u201cMINOS 5.0 user's guide,\u201d Technical Report SOL 83-20, Systems Optimization Laboratory, Department of Operations Research, Stanford University (Stanford, CA, 1983)."},{"key":"CR23","volume-title":"Combinatorial Optimization:Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1982","unstructured":"C.H. Papadimitriou and K. Steiglitz,Combinatorial Optimization:Algorithms and Complexity (Prentice Hall, Englewood Cliffs, NJ, 1982)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580890.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01580890\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01580890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T15:12:12Z","timestamp":1556896332000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01580890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,8]]},"references-count":23,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1992,8]]}},"alternative-id":["BF01580890"],"URL":"https:\/\/doi.org\/10.1007\/bf01580890","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,8]]}}}