A method for approximating symmetrically reciprocal matrices by transitive matrices
From MaRDI portal
Publication:2484490
DOI10.1016/J.LAA.2005.02.002zbMATH Open1098.15015OpenAlexW2031789712MaRDI QIDQ2484490FDOQ2484490
Authors: Geir Dahl 
Publication date: 1 August 2005
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2005.02.002
Recommendations
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- A scaling method for priorities in hierarchical structures
- Max-algebra and pairwise comparison matrices
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A characterization of the minimum cycle mean in a digraph
- On the optimal consistent approximation to pairwise comparison matrices
- Transitive matrices and their applications
- Consistency adjustments for pairwise comparison matrices
- Modifying the power method in max algebra
- An efficient algorithm for critical circuits and finite eigenvectors in the max-plus algebra
Cited In (6)
- Approximating Matrices with Multiple Symmetries
- Max-algebra and pairwise comparison matrices. II.
- Approximation of positive matrices by transitive matrices
- Reciprocal matrices: properties and approximation by a transitive matrix
- A matrix-based ranking method with application to tennis
- HodgeRank is the limit of Perron Rank
This page was built for publication: A method for approximating symmetrically reciprocal matrices by transitive matrices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2484490)
