Sign up ×
Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

I was wondering

  1. 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?
  2. Is any dynamic programming problem essentially a linear integer programming problem?
  3. 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!

share|cite|improve this question

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.