Robust path choice in networks with failures
暂无分享,去创建一个
[1] Kai Lai Chung,et al. Markov Chains with Stationary Transition Probabilities , 1961 .
[2] J. D. Murchland,et al. Braess's paradox of traffic flow , 1970 .
[3] Terry L. Friesz,et al. Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems , 1994, Oper. Res..
[4] Moshe Ben-Akiva,et al. Dynamic network models and driver information systems , 1991 .
[5] André de Palma,et al. Does providing information to drivers reduce traffic congestion , 1991 .
[6] Andrzej Ruszczynski,et al. Decomposition methods in stochastic programming , 1997, Math. Program..
[7] Giovanni Andreatta,et al. Stochastic shortest paths with recourse , 1988, Networks.
[8] Tom van Vuren,et al. THE MODELLING OF DYNAMIC ROUTE GUIDANCE SYSTEMS , 1993 .
[9] John N. Tsitsiklis,et al. An Analysis of Stochastic Shortest Path Problems , 1991, Math. Oper. Res..
[10] Warren B. Powell,et al. Stochastic and dynamic networks and routing , 1995 .
[11] Dietrich Braess,et al. Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.
[12] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .
[13] J. Tsitsiklis,et al. Stochastic shortest path problems with recourse , 1996 .