Deriving priorities from inconsistent PCM using network algorithms (Q1730702)

From MaRDI portal
Revision as of 22:28, 14 September 2024 by Daniel (talk | contribs) (‎Created claim: Wikidata QID (P12): Q129892752, #quickstatements; #temporary_batch_1726345393210)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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
    0 references
    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

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references