Deriving priorities from inconsistent PCM using network algorithms (Q1730702): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q129892752, #quickstatements; #temporary_batch_1726345393210 |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1007/s10479-018-2888-x / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S10479-018-2888-X / rank | |||
Normal rank | |||
Latest revision as of 06:17, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Deriving priorities from inconsistent PCM using network algorithms |
scientific article |
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
