.png){kind=icon}
Return
Enumerating all spanning trees for pairwise comparisons
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.03.010.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Determining the most suitable prioritization method for pairwise comparisons remains an open problem. This paper proposes a method based on the generation of all possible preferences from a set of judgments in pairwise comparisons. A concept of pivotal combination is introduced using a graph-theoretic approach. A set of preferences is generated by enumerating all spanning trees. The mean of these preferences is proposed as a final priority vector, and variance gives a measure of inconsistency. The proposed method provides a way of ordering objects according to a voting scheme. The proposed method is also applicable to incomplete sets of pairwise comparisons without modification, unlike other popular methods which require intermediate steps to estimate missing judgments. (C) 2011 Elsevier Ltd. All rights reserved.
Keywords:
Pairwise comparisons
Decision making
MCDM
Graph theory
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
Organization
Cited Papers
ShareSave
ShareSaveShareSaveCauses and Circumstances of Neonatal Deaths in 108 Consecutive Cases over a 10-Year Period at the Children’s Hospital of Lucerne, Switzerland.png)
Neonatology
NeonatologyIF0
PREAI
ShareSave
View more