Making sparse matrices sparser: Computational results

DOI10.1007/BF01588780MaRDI QIDQ751503zbMATH OpenFDO

Authors S. Thomas McCormick

Publication date 1990

Published in Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01588780

zbMATH Keywords

sparse matricesheuristic algorithmcomputational resultspreprocessingbipartite matchingSimplex AlgorithmSparsity Problem

Mathematics Subject Classification ID

Linear programming (90C05) Large-scale problems in mathematical programming (90C06) Computational methods for problems pertaining to operations research and mathematical programming (90-08)

Recommendations

• A hierarchical algorithm for making sparse matrices sparser
• scientific article; zbMATH DE number 3852786
• Implementation and computational results for the hierarchical algorithm for making sparse matrices sparser
• Sparsification of rectangular matrices
• scientific article; zbMATH DE number 3905737

Cites work

• scientific article; zbMATH DE number 3833697 (Why is no real title available?)
• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3905737 (Why is no real title available?)
• scientific article; zbMATH DE number 3537147 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 3793772 (Why is no real title available?)
• A hierarchical algorithm for making sparse matrices sparser
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• Converting Linear Programs to Network Problems
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem
• The Weighted Sparsity Problem: Complexity and Algorithms
• The elimination form of the inverse and its application to linear programming

Cited in

(11)

• Mixed-integer programming techniques for the connected max-\(k\)-cut problem
• Sparsification of rectangular matrices
• scientific article; zbMATH DE number 5929618 (Why is no real title available?)
• Computing the spark: mixed-integer programming for the (vector) matroid girth problem
• Sparsity of integer formulations for binary programs
• Graph extensions and some optimization problems in sparse matrix computations
• scientific article; zbMATH DE number 3905737 (Why is no real title available?)
• A practical method for compressing sparse matrices with variant entries
• A hierarchical algorithm for making sparse matrices sparser
• scientific article; zbMATH DE number 1760021 (Why is no real title available?)
• Assembling sparse matrices in MATLAB

Describes a project that uses

Uses Software

• MA28

This page was built for publication: Making sparse matrices sparser: Computational results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q751503)