A hierarchical algorithm for making sparse matrices sparser

DOI10.1007/BF01580890zbMath0770.90039OpenAlexW1980894883MaRDI QIDQ1207308

S. Thomas McCormick, S. Frank Chang

Publication date: 1 April 1993

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

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

zbMATH Keywords

linearly constrained optimizationsparsity problem

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Linear programming (90C05)

Related Items (5)

Matrix sparsification and the sparse null space problem ⋮ Presolving in linear programming ⋮ Efficient preprocessing for VLSI optimization problems ⋮ Computing the spark: mixed-integer programming for the (vector) matroid girth problem ⋮ Making sparse matrices sparser: Computational results

Uses Software

• MINOS
• HASP

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Making sparse matrices sparser: Computational results
• Large sparse numerical optimization
• The ellipsoid method and its consequences in combinatorial optimization
• Manifestations of the Schur complement
• Remarks on implementation of O ( n ^1/2 τ) assignment algorithms
• Data Structures and Programming Techniques for the Implementation of Karmarkar's Algorithm
• Analysis of mathematical programming problems prior to applying the simplex algorithm
• Optimal approximation of sparse hessians and its equivalence to a graph coloring problem

This page was built for publication: A hierarchical algorithm for making sparse matrices sparser