Discrete-time Markov chain

Discrete-time Markov chain , Discrete-time Markov chain , کتابخانه دیجیتال جندی شاپور اهواز

[1]  Panos M. Pardalos,et al.  Detecting critical nodes in sparse graphs , 2009, Comput. Oper. Res..

[2]  K. Subramani,et al.  A faster algorithm for the single source shortest path problem with few distinct positive lengths , 2010, J. Discrete Algorithms.

[3]  Wei Liu.  Uncertain Programming Models for Shortest Path Problem with Uncertain Arc Lengths , 2010 .

[4]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[5]  Marco Di Summa,et al.  Complexity of the critical node problem over trees , 2011, Comput. Oper. Res..

[6]  John N. Tsitsiklis,et al.  An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..

[7]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[8]  Sheldon M. Ross.  Introduction to Probability Models. , 1995 .

[9]  Chelsea C. White,et al.  The Dynamic and Stochastic Shortest Path Problem with Anticipation 1 , 2005 .

[10]  Masaaki Kijima,et al.  Markov processes for stochastic modeling , 1997 .

[11]  V. G. Kulkarni,et al.  Shortest paths in networks with exponentially distributed arc lengths , 1986, Networks.

[12]  Y. Nie,et al.  Arriving-on-time problem : Discrete algorithm that ensures convergence , 2006 .

[13]  Dongjoo Park,et al.  Dynamic and stochastic shortest path in transportation networks with two components of travel time uncertainty , 2003 .

[14]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[15]  Amir Azaron,et al.  Distribution function of the shortest path in networks of queues , 2005, OR Spectr..

[16]  Enrico Nardelli,et al.  A faster computation of the most vital edge of a shortest path , 2001, Inf. Process. Lett..

[17]  Daniel Vanderpooten,et al.  Efficient determination of the k most vital edges for the minimum spanning tree problem , 2012, Comput. Oper. Res..

[18]  Yuan Gao,et al.  Shortest path problem with uncertain arc lengths , 2011, Comput. Math. Appl..

[19]  Yueyue Fan,et al.  Shortest paths in stochastic networks with correlated link costs , 2005 .