Access the full text.
Sign up today, get DeepDyve free for 14 days.
Ellis Johnson (1966)
Networks and Basic SolutionsOper. Res., 14
J. Maurras (1972)
Optimization of the flow through networks with gainsMathematical Programming, 3
J. Shapiro (1968)
Shortest Route Methods for Finite State Space Deterministic Dynamic Programming ProblemsSiam Journal on Applied Mathematics, 16
The simplex method is specialized for a special class of networks with gains arising in discounted deterministic Markov decision models.
Management Science – INFORMS
Published: Jul 1, 1974
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.