Shortest Path Problem
Problem Formulation
Definition1.1 G = ⟨ V , E , h ⟩ G=\langle V, E, h\rangle G=⟨V,E,h⟩ is a weighted graph where the graph G = ⟨ V , E ⟩ G=\langle V, E\rangle G=⟨V,E⟩ is equipped with a positive cost function h h h defined on all edges in E E E.
Definition1.2 Fix a weighted graph G = ⟨ V , E , h ⟩ G=\langle V, E, h\rangle G=⟨V,E,h⟩ and O ∈ V O \in V O∈V the origin, T ∈ V T \in V T∈V the termination. The shortest-path problem for G G G is defined by looking for a path x 0 x 1 − x 1 x 2 − x N − 1 x N x_{0} x_{1}-x_{1} x_{2}-x_{N-1} x_{N} x0x1−x1x2−xN−1xN with x 0 = O x_{0} =O x0=O and $ x_{N}=T$ such that the total cost ∑ t = 1 N h ( x t − 1 x t ) \sum_{t=1}^{N} h\left(x_{t-1} x_{t}\right) ∑t=1Nh(xt−1xt)is minimized sum.
Relationship with Mathematical Programming
Note:
Expl