ACM

Communications of the ACM

Home/Magazine Archive/September 1983 (Vol. 26, No. 9)/Optimal paths in graphs with stochastic or multidimensional.../Abstract

Optimal paths in graphs with stochastic or multidimensional weights

By Ronald Prescott Loui
Communications of the ACM, September 1983, Vol. 26 No. 9, Pages 670-676
10.1145/358172.358406
Comments

View as: Print Mobile App ACM Digital Library Full Text (PDF) Share:

This paper explores computationally tractable formulations of stochastic and multidimensional optimal path problems, each as an extension of the shortest path problem. A single formulation encompassing both problems is considered, in which a utility function defines preference among candidate paths. The result is the ability to state explicit conditions for exact solutions using standard methods, and the applicability of well-understood approximation techniques.

The full text of this article is premium content

No entries found

Log in to Read the Full Article

Sign In

Sign in using your ACM Web Account username and password to access premium content if you are an ACM member, Communications subscriber or Digital Library subscriber.

Need Access?

Please select one of the options below for access to premium content and features.

Create a Web Account

If you are already an ACM member, Communications subscriber, or Digital Library subscriber, please set up a web account to access premium content on this site.

Join the ACM

Become a member to take full advantage of ACM's outstanding computing information resources, networking opportunities, and other benefits.

Subscribe to Communications of the ACM Magazine

Get full access to 50+ years of CACM content and receive the print version of the magazine monthly.

Purchase the Article

Non-members can purchase this article or a copy of the magazine in which it appears.