2
$\begingroup$

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!

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.