Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment (Q359406)
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: Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment |
scientific article; zbMATH DE number 6197583
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment |
scientific article; zbMATH DE number 6197583 |
Statements
Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment (English)
0 references
12 August 2013
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.91938967
0 references
0.9115766
0 references
0.90926063
0 references
0.9056894
0 references
0.90482646
0 references
0.8956256
0 references
0.8922873
0 references
