User menu

Characteristic functions of directed graphs and applications to stochastic equilibrium problems

Bibliographic reference Nesterov, Yurii. Characteristic functions of directed graphs and applications to stochastic equilibrium problems. In: Optimization and Engineering, Vol. 8, no. 2, p. 193-214 (Juin 2007)
Permanent URL http://hdl.handle.net/2078.1/23373
  1. Akamatsu T (1996) Cyclic flows Markov process and stochastic traffic assignment. Transp Res B 30:369–386
  2. Akamatsu T (1997) Decomposition of path choice entropy in general transport networks. Transp Sci 31(4):349–362
  3. Anderson SP, de Palma A, Thisse J-F (1992) Discrete choice theory of product differentiation. MIT, Cambridge
  4. Bell M (1995) Alternatives to dial’s logit assignment algorithm. Transp Res B 298(4):287–295
  5. Nemirovskii A (1995) Polynomial time methods in convex programming. In: Renegar J, Schub M, Smale S (eds) The mathematics of numerical analysis. AMS–SIAM summer seminar in applied mathematics, Park City, UT, 17 July–11 August 1995. Lectures in applied mathematics, vol. 32. Amer Math Soc, Providence
  6. Nesterov Y (2000) Stable traffic equilibria: properties and applications. Optim Eng 1(1):29–50
  7. Nesterov Y, de Palma A (2003) Static equilibrium in congested transportation networks. Networks Spatial Econ 3(3):371–395
  8. Nesterov Yurii, Nemirovskii Arkadii, Interior-Point Polynomial Algorithms in Convex Programming, ISBN:9780898713190, 10.1137/1.9781611970791
  9. Sheffi Y (1985) Urban Transportation networks: equilibrium analysis with mathematical programming methods. Prentice-Hall, Englewood Cliffs
  10. Wardrop JG (1952) Some theoretical aspects of road traffic research. In: Proceedings of the Institute of Civil Engineers, part II, pp. 325–378