… The procedure FIND determines the optimal arc-set rj with respect to the current labels C(k,s),
(k,s) e FS(j) and updates CU,s). This task can be performed with an efficient algorithm, …

… Author links open overlay panel Stella Rosson a b c , Renato de Filippis b d , Giovanni Croatto
a c , Enrico Collantoni c , Simone Pallottino e , Daniel Guinart b f g h , Andre R. Brunoni i j …

… 6 by removing the cutset of gs: we disconnect t from s, by removing the cutset of @ only the
B-connection of t to s is lost, while t remains both connected and B-connected to s when we …

… Consider a given destination s, and let S~ be the length of a shortest hyperpath from
node i to s. We now have all the ingredients to state the following important result: …

… For an extended survey on the subject, we refer to Gallo and Pallottino [16], where the
shortest path methods are presented in a unified framework. There, all the algorithms are shown …

… s. In particular, the most negative valued basic arc, which leaves the basis in Florian, Nguyen
and Pallottino's … first reverse arc along the basic tree path from s to r. The removal of this arc …

… Recently Gallo and Pallottino [ 121 found that all shortest-path tree algorithms are special
cases of a more general … The lengths of the SPs are the solution of Bellman’s equations [2] : …

… We give now a formal description of S-heap, where Q(I… SDijkstra's, but with similar response
to variations in the characteristics of the graphs. S-heap behaves better than S-Dijkstra and S…

… To explicitly capture the implicit FIFO rule that binds passengers at every transit node s, we
consider in the sequel that the set of arcs incident into each node j ∈ Ks—the backward star …

In this paper we present a scenario analysis approach for water system planning and
management under conditions of climatic and hydrological uncertainty. The scenario analysis …