Stattic Traffic Assignment Problem: A comparison between Beckmann (1956) and Nesterov & De Palma (1998) models
暂无分享,去创建一个
[1] Hillel Bar-Gera,et al. Origin-Based Algorithm for the Traffic Assignment Problem , 2002, Transp. Sci..
[2] Christos H. Papadimitriou,et al. Worst-case Equilibria , 1999, STACS.
[3] André de Palma,et al. Stationary Dynamic Solutions in Congested Transportation Networks: Summary and Perspectives , 2003 .
[4] J. G. Wardrop,et al. Some Theoretical Aspects of Road Traffic Research , 1952 .
[5] Yurii Nesterov,et al. Primal-dual subgradient methods for convex problems , 2005, Math. Program..
[6] José R. Correa,et al. Sloan School of Management Working Paper 4319-03 June 2003 Selfish Routing in Capacitated Networks , 2022 .
[7] T. Koopmans,et al. Studies in the Economics of Transportation. , 1956 .
[8] Tim Roughgarden,et al. Bounding the inefficiency of equilibria in nonatomic congestion games , 2004, Games Econ. Behav..
[9] A. Nagurney,et al. A retrospective on Beckmann, McGuire and Winsten's "Studies in the Economics of Transportation" , 2005 .
[10] Torbjörn Larsson,et al. Side constrained traffic equilibrium models: analysis, computation and applications , 1999 .
[11] A. Palma,et al. Optimization formulations and static equilibrium in congested transportation networks , 1998 .
[12] A. Palma,et al. Stable Dynamics in Transportation Systems , 2000 .
[13] Tim Roughgarden,et al. The price of anarchy is independent of the network topology , 2002, STOC '02.
[14] Tim Roughgarden,et al. How bad is selfish routing? , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[15] A. Nagurney. Network Economics: A Variational Inequality Approach , 1992 .