Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment (Q359406)

From MaRDI portal
Revision as of 18:48, 6 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment
scientific article

    Statements

    Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment (English)
    0 references
    0 references
    12 August 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    shortest path problem
    0 references
    intuitionistic fuzzy sets
    0 references
    intutionistic fuzzy value
    0 references
    intuitionistic fuzzy numbers
    0 references
    intutionistic fuzzy hybrid geometric operator
    0 references
    decision making problem
    0 references
    Dijkstra's algorithm
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references