✦ LIBER ✦

Stochastic shortest paths with recourse

✍ Scribed by Giovanni Andreatta; Luciano Romeo

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 491 KB
Volume: 18
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.3230180306

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial-time algorithm to find shor

A polynomial-time algorithm to find shortest paths with recourse

✍ J. Scott Provan 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 246 KB

Shortest paths in stochastic networks wi

Shortest paths in stochastic networks with ARC lengths having discrete distributions

✍ Gehan A. Corea; Vidyadhar G. Kulkarni 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 688 KB

## Abstract In this work, we compute the distribution of __L__\*, the length of a shortest __(s, t)__ path, in a directed network __G__ with a source node __s__ and a sink node __t__ and whose arc lengths are independent, nonnegative, integer valued random variables having finite support. We constr

Solving stochastic programs with network

Solving stochastic programs with network recourse

✍ Stein W. Wallace 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 997 KB

In this paper we provide computational procedures for solving stochastic programs with network recourse. Special attention is paid to the feasibility problem, and we show how to solve the recourse or second stage problem. This problem is how to solve a large number of networks where the only differe

Iterative methods for dynamic stochastic

Iterative methods for dynamic stochastic shortest path problems

✍ Raymond K. Cheung 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 147 KB 👁 1 views

We consider a routing policy that forms a dynamic shortest path in a network with independent, positive and discrete random arc costs. When visiting a node in the network, the costs for the arcs going out of this node are realized, and then the policy will determine which node to visit next with the

State space partitioning methods for sto

State space partitioning methods for stochastic shortest path problems

✍ Alexopoulos, Christos 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 150 KB 👁 2 views

This paper describes methods for computing measures related to shortest paths in networks with discrete random arc lengths. These measures include the probability that there exists a path with length not exceeding a specified value and the probability that a given path is shortest. The proposed meth

On a stochastic program with simple reco

On a stochastic program with simple recourse

✍ Wei Shen Hsia 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 337 KB