Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
Purge
English
Log in

T*: a weighted double-heuristic search algorithm to find the shortest path

From MaRDI portal
Publication:2224337
Jump to:navigation, search

DOI10.1504/IJCSM.2019.097636zbMath1453.90178MaRDI QIDQ2224337

Mohammad Samadi Gharajeh

Publication date: 3 February 2021

Published in: International Journal of Computing Science and Mathematics (Search for Journal in Brave)




zbMATH Keywords

shortest pathgraph theorysearch algorithmweighted strategydouble-heuristic function


Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)







This page was built for publication: T*: a weighted double-heuristic search algorithm to find the shortest path

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2224337&oldid=14762629"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 2 February 2024, at 04:46.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki