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.
No comments :
Post a Comment