Deriving priorities from inconsistent PCM using network algorithms (Q1730702)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Deriving priorities from inconsistent PCM using network algorithms |
scientific article; zbMATH DE number 7032683
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Deriving priorities from inconsistent PCM using network algorithms |
scientific article; zbMATH DE number 7032683 |
Statements
Deriving priorities from inconsistent PCM using network algorithms (English)
0 references
6 March 2019
0 references
pairwise comparisons
0 references
shortest path problem
0 references
network simplex method
0 references
Pareto efficiency
0 references
0 references
0 references
0 references
0 references
0 references
0 references
0.7886074185371399
0 references
0.773205041885376
0 references
0.7712966203689575
0 references
0.7709508538246155
0 references
