Can I read Stochastic Shortest Path Problems with Recourse on EtoBox?

Stochastic Shortest Path Problems with Recourse by Polychronopoulos, George H.; Tsitsiklis, John N. is a Computer Science article available to read on EtoBox.

What is Stochastic Shortest Path Problems with Recourse about?

We consider shortest path problems defined on graphs with random arc costs. We assume that information on arc cost values is accumulated as the graph is being traversed. The objective is to devise a policy that leads from an origin to a destination node with minimal expected cost. We provide dynamic programming algorithms, estimates for their complexity, negative complexity results, and analysis of some possible heuristic algorithms. 0 7996 John Wiley & Sons, Inc.

Who reads Stochastic Shortest Path Problems with Recourse?

Author

Polychronopoulos, George H.; Tsitsiklis, John N.

Publisher

John Wiley and Sons; Wiley (John Wiley & Sons); John Wiley & Sons Inc.; Wiley (ISSN 0028-3045)

Published

1996

Language

EN

Field

Computer Science (Physical Sciences)