Robust path choice in networks with failures
暂无分享,去创建一个
[1] Kai Lai Chung,et al. Markov Chains with Stationary Transition Probabilities , 1961 .
[2] Mike McDonald,et al. The modelling of dynamic route guidance , 1991 .
[3] Giovanni Andreatta,et al. Stochastic shortest paths with recourse , 1988, Networks.
[4] Moshe Ben-Akiva,et al. Dynamic network models and driver information systems , 1991 .
[5] David Kendrick,et al. GAMS, a user's guide , 1988, SGNM.
[6] David K. Smith. Network Flows: Theory, Algorithms, and Applications , 1994 .
[7] Michael Patriksson,et al. The Traffic Assignment problem , 1994 .
[8] George L. Nemhauser,et al. A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure , 2000, Oper. Res..
[9] André de Palma,et al. Does providing information to drivers reduce traffic congestion , 1991 .
[10] Terry L. Friesz,et al. Day-To-Day Dynamic Network Disequilibria and Idealized Traveler Information Systems , 1994, Oper. Res..
[11] Roger J.-B. Wets. Large Scale Linear Programming Techniques in Stochastic Programming , 1984 .
[12] Dietrich Braess,et al. Über ein Paradoxon aus der Verkehrsplanung , 1968, Unternehmensforschung.
[13] Dimitri P. Bertsekas,et al. Dynamic Programming and Optimal Control, Two Volume Set , 1995 .