| Hi-index | 0.00 |
This work studies the problem of finding optimal paths with respect to the center, median and centdian objective functions, on networks with uncertain vertex weights that are given as intervals. Our approach looks for minimax regret paths which minimize the worst-case opportunity loss in the corresponding objective function. These problems are NP-hard on general graphs, therefore we study them on trees. We show that a discrete optimal path always exists for each of them, and provide polynomial time solution algorithms. © 2011 Wiley Periodicals, Inc. NETWORKS, 2011 © 2011 Wiley Periodicals, Inc.