Dijkstra's algorithm for solving the shortest path problem on networks under intuitionistic fuzzy environment (Q359406): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10852-012-9191-7 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1971087042 / rank | |||
Normal rank | |||
Revision as of 03:48, 20 March 2024
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
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
