I was wondering
- if any dynamic programming problem can always be converted to a source-sink shortest path problem in a network with source and sink nodes given? And vice versa?
- Is any dynamic programming problem essentially a linear integer programming problem?
- if in a network, the shortest path length between every vertices defines a metric on the set of vertices of the network?
Thanks and regards!