Cart (Loading....) | Create Account
Close category search window

Application of Dynamic Programming to Routing Problems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jefferis, R.P. ; The Moore School of Electrical Engineering, University of Pennsylvania, Philadelphia, Pa. ; Fegley, K.A.

Dynamic programming is applicable to routing problems where the objective is to find the route between two points which will minimize some cost function. Although the computational procedure to find the solution to routing problems is more complex than for the majority of dynamic programming problems, solution algorithms are available and can be readily applied. Such an algorithm is presented; and, as an example of routing problems that are readily handled by dynamic programming, the route which minimizes the cost of constructing a pipeline between Fostoria, Ohio, and Columbus, Ohio, is determined.

Published in:

Systems Science and Cybernetics, IEEE Transactions on  (Volume:1 ,  Issue: 1 )

Date of Publication:

Nov. 1965

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.