Tightest Admissible Shortest Path: Optimizing Edge-Weight Uncertainty in Graph Search

The tightest admissible shortest path (TASP) problem aims to find the path with the tightest suboptimality bound on the optimal cost in a graph with uncertain edge weights.