Deriving priorities from inconsistent PCM using network algorithms (Q1730702): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Created claim: Wikidata QID (P12): Q129892752, #quickstatements; #temporary_batch_1726345393210 |
||
| Property / Wikidata QID | |||
| Property / Wikidata QID: Q129892752 / rank | |||
Normal rank | |||
Revision as of 21:28, 14 September 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
