Lecture 17 Shortest Path Problem - University of Illinois ...

Lecture 17 Transform the problem to minimization form Let P be the set of all paths from node 1 to node 7. Let p ∈ P be a path. Let ‘ ∈ p denote that link ‘ is traversed in a path p. The maximum reliable route is the following problem max p∈P Π ‘∈pπ By taking ln transformation of the objective, the problem is equivalent to max ................
................