Making sparse matrices sparser: Computational results

DOI10.1007/BF01588780zbMath0714.90067MaRDI QIDQ751503

S. Thomas McCormick

Publication date: 1990

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

zbMATH Keywords

sparse matricescomputational resultsheuristic algorithmbipartite matchingpreprocessingSimplex AlgorithmSparsity Problem

Mathematics Subject Classification ID

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

Related Items (4)

Mixed-integer programming techniques for the connected max-\(k\)-cut problem ⋮ A hierarchical algorithm for making sparse matrices sparser ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Sparsity of integer formulations for binary programs

Uses Software

• MA28

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A hierarchical algorithm for making sparse matrices sparser
• The Elimination form of the Inverse and its Application to Linear Programming
• 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
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

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