On use of assignment algorithms to reconstruct inverse matrices

zbMATH Open1245.90045MaRDI QIDQ3115503FDOQ3115503

Authors: G. I. Zabinyako 

Publication date: 10 February 2012

Recommendations

• Reordering inverse matrices
• Efficient dual simplex algorithms for the assignment problem
• A new product form of the inverse
• A genuinely polynomial primal simplex algorithm for the assignment problem
• Construction of LU Factors of the Basis to Reduce Build-Up during Simplex Iterations

zbMATH Keywords

algorithmsnumerical examplessparse matrixassignment problempivotsrevised simplex method

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Direct numerical methods for linear systems and matrix inversion (65F05) Computational methods for sparse matrices (65F50) Linear programming (90C05) Theory of matrix inversion and generalized inverses (15A09) Discrete location and assignment (90B80)

Cited In (1)

• Reordering inverse matrices

This page was built for publication: On use of assignment algorithms to reconstruct inverse matrices

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