On the performance of user equilibria in traffic networks

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2003, Pages 86-87

  Schulz, Andreas S ^a   Moses, Nicolás Stier ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ENGINEERS; MATHEMATICAL MODELS; OPTIMIZATION; PLANNING; ROUTERS; TELECOMMUNICATION TRAFFIC;

TRAFFIC ENGINEERS; TRAFFIC NETWORKS; TRAFFIC PLANNING;

TELECOMMUNICATION NETWORKS;

EID: 0038078085     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (5)

1. Jahn, O., R. Möhring, and A. Schulz (2000). Optimal routing of traffic flows with length restrictions in networks with congestion. In Operations Research Proceedings 1999, pp. 437-442. Springer.
2. Murchland, J. (1970). Braess's paradox of traffic flow. Transportation Research 4, 391-394.
3. Roughgarden, T. (2002). The Price of Anarchy is Independent of the Network Topology. Manuscript. To appear in Journal of Computer and System Sciences.
4. Roughgarden, T. and E. Tardos (2002). How bad is selfish routing? Journal of the ACM 49(2), 236-259.
5. Wardrop, J. (1952). Some theoretical aspects of road traffic research. In Proceedings of the Institution of Civil Engineers, Volume 1, pp. 325-378.