Saturday, November 16, 2013

[qpuiksxt] Shortest expected path to success

Given a complete graph with edges with costs and nodes with probabilities of success, determine the path which minimizes the expected total edge cost until reaching success.  Don't visit nodes a second time.

If all probabilities identical then equivalent to traveling salesman problem.

Looking for parking.

No comments :