Chapter 6 Network Equilibrium Models and Algorithms

Handbooks in Operations Research and Management Science

Volumn 8, Issue C, 1995, Pages 485-550

  Florian, Michael ^a   Hearn, Donald ^b  

^a UNIVERSITÉ DE MONTRÉAL   (Canada)

^b UNIVERSITY OF FLORIDA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 77957094045     PISSN: 09270507     EISSN: None     Source Type: Book Series    
DOI: 10.1016/S0927-0507(05)80110-0     Document Type: Review

References (227)

1. Aashtiani, H.Z., Magnanti, T.L., Equilibria on a congested transportation network. SIAM J. Algebraic Discr. Methods 2 (1981), 213–226.
2. Aashtiani, H.Z., Magnanti, T.L., A linearization and decomposition algorithm for computing urban traffic equilibria. Proc. 1982 IEEE Large Scale Systems Symposium, 1982, 8–19.
3. Abdulaal, M., LeBlanc, L.J., Methods for combining modal split and equilibrium assignment models. Transp. Sci. 13 (1979), 292–314.
4. Ahn, B.-H., Computation of Market Equilibria for Policy Analysis: the Project Independence Evaluation Systems (PIES) Approach. 1979, Garland, Kansas City, Mo.
5. Ahn, B.-H., Hogan, W.W., On convergence of the PIES algorithm for computing equilibria. Oper. Res. 30 (1982), 281–300.
6. Arezki, Y., Van Vliet, D., A full analytical implementation of the PARTAN/Frank-Wolfe algorithm for equilibrium assignment. Transp. Sci. 24 (1990), 58–62.
7. Asmuth, R., Traffic network equilibria. Ph.D. dissertation, 1978, Stanford University, New York, NY.
8. Assad, A.A., Multicommodity network flow — a survey. Networks 8 (1978), 37–91.
9. Auchmuty, G., Variational principles for variational inequalities. Numer. Funct. Anal. Optim. 10 (1989), 863–874.
10. Auslender, A., Optimisation. Méthodes Numériques. 1976, Masson, Stanford, CA.
11. Babin, A., Florian, M., James-Lefebvre, L., Spiess, H., EMME/2: Interactive graphic method for road and transit planning. Transp. Res. Rec. 866 (1982), 1–9.
12. Barton, R.R., Hearn, D.W., Ribera, J., On the equivalence of transfer and generalized Benders decomposition. Transp. Res. 23B (1989), 61–73.
13. Bazaraa, M.S., Shetty, C.M., Nonlinear programming, theory and algorithms. 1979, John Wiley & Sons, Inc., Paris.
14. Beckmann, M.J., On the theory of traffic flow in networks. Traffic Q. 21 (1967), 109–117.
15. Beckmann, M., McGuire, C.B., Winsten, C.B., Studies in the Economics of Transportation. 1956, Yale University Press, NY.
16. Bertsekas, D.P., On the Goldstein-Levitin-Polyak gradient projection method. IEEE Trans. Automatic Control AC-21 (1976), 174–184.
17. Bertsekas, D.P., Algorithms for nonlinear multicommodity network flow problems. Bensoussan, A., Lions, J.L., (eds.) Proceedings of the International Symposium on Systems Optimization and Analysis, 1979, Springer-Verlag, New Haven, CT, 210–224.
18. Bertsekas, D.P., A class of optimal routing algorithms for communication network. Proc. 5th Int. Conf. on Computer Communications, Atlanta, GA, 1980, 71–76.
19. Bertsekas, D.P., Projected Newton methods for optimization problems with simple constraints. SIAM J. Control Optim. 20 (1982), 221–246.
20. Bertsekas, D.P., Gafni, E.M., Projection methods for variational inequalities with application to the traffic assignment problem. Math. Program. Study 17 (1982), 139–159.
21. Bertsekas, D.P., Gallager, R.G., Data Communication Networks. 1987, Prentice-Hall, NY.
22. Bertsekas, D.P., Gendron, B., Tsai, W.K., Implementation of an optimal multicommodity network flow algorithm based on gradient projection and a path flow formulation. Technical Report LIDS-P-1364, 1984, Laboratory for Information and Decision Studies, Massachusetts Institute of Technology, Englewood Cliffs, NJ.
23. Bertsekas, D.P., Tsitsiklis, J.N., Parallel and Distributed Computation. Numerical Methods. 1989, Prentice-Hall, Cambridge, MA.
24. Boyce, D.E., Urban transportation network-equilibrium and design models: recent achievements and future prospects. Environ. Plann. 16A (1984), 1445–1474.
25. Boyce, D.E., LeBlanc, L.J., Chou, K.S., Network equilibrium models for urban location and travel choices: a retrospective survey. J. Region. Sci. 28 (1988), 159–183.
26. Braess, D., Über ein Paradoxen der Verkehrsplannung. Unternehmenforschung 12 (1968), 258–268.
27. Braess, D., Koch, G., On the existence of equilibria in asymmetrical multiclass-user transportation networks. Transp. Sci. 13 (1979), 56–63.
28. Beiträge zur Theorie des Verkehrsflusses Strassenbau und Strassenverkehrstechnik Heft 86 Bruynooghe, M., Gibert, A., Sakarovitch, M., Une méthode d'affectation du trafic. Lentzback, W., Baron, P., (eds.) Fourth International Symposium on the Theory of Traffic Flow, Karlsruhe, 1968, 1969, Herausgeben von Bundesminister fur Verkehr, Abteilung Strassenbau, Englewood Cliffs, NJ, 198–204.
29. Burrell, J.E., Multipath route assignment and its application to capacity restraint. Lentzback, W., Baron, P., (eds.) Fourth International Symposium on the Theory of Traffic Flow, Karlsruhe, 1968 Beiträge zur Theorie des Verkehrsflusses Strassenbau und Strassenverkehrstechnik Heft 86, 1969, Herausgeben von Bundesminister fur Verkehr, Abteilung Strassenbau, Bonn.
30. Burrell, J.E., Multiple route assignment: A comparison of two methods. Florian, M.A., (eds.) Traffic equilibrium methods, Proceedings of the International Symposium in Montreal, Lecture Notes in Economics and Mathematical Systems 118, 1976, Springer-Verlag, Bonn, 229–239.
31. Canon, M.D., Cullum, C.D., A tight upper bound on the rate of convergence of the Frank-Wolfe algorithm. SIAM J. Control 6 (1968), 509–516.
32. Cantor, D.G., Gerla, M., Optimal routing in a packet switched network. IEEE Trans. Comput. C-23 (1974), 1062–1069.
33. Carey, M., The dual of the traffic assignment problem with elastic demands. Transp. Res. 19B (1985), 227–237.
34. Chao, G.S., Friesz, T.L., Spatial price equilibrium sensitivity analysis. Trans. Res. 18B (1984), 423–440.
35. Charnes, A., Cooper, W.W., Extremal principles for simulating traffic flow in a network. Proc. National Academy of Science of the United States of America, Washington, DC, 1958, 201–204.
36. Charnes, A., Cooper, W.W., Multicopy traffic network models. Herman, R., (eds.) Theory of Traffic Flow, 1961, Elsevier, Berlin, 85–96.
37. Collins, M., Cooper, L., Helgason, R., Kennington, J., LeBlanc, L., Solving the pipe network analysis problem using optimization techniques. Manage. Sci. 24 (1978), 747–760.
38. Collins, M., Cooper, L., Helgason, R., Kennington, J., Solution of large scale pipe networks by improved mathematical approaches. IEOR Report 77016-WR77001, 1978, School of Engineering and Applied Science, Southern Methodist University, Amsterdam.
39. Dafermos, S., An extended traffic assignment model with applications to two-way traffic. Transp. Sci. 5 (1971), 366–389.
40. Dafermos, S., The traffic assignment problem for multiclass-user transportation networks. Transp. Sci. 6 (1972), 73–87.
41. Dafermos, S., Toll patterns for multi-class user transportation networks. Transp. Sci. 7 (1973), 211–223.
42. Dafermos, S., Traffic equilibrium and variational inequalities. Transp. Sci. 14 (1980), 42–54.
43. Dafermos, S., The general multimodal network equilibrium problem with elastic demand. Networks 12 (1982), 57–72.
44. Dafermos, S., Relaxation algorithms for the general asymmetric traffic equilibrium problem. Transp. Sci. 16 (1982), 231–240.
45. Dafermos, S., An iterative scheme for variational inequalities. Math. Program. 26 (1983), 40–47.
46. Dafermos, S., Sensitivity analysis in variational inequalities. Math. Oper. Res. 13 (1988), 421–434.
47. Dafermos, S., Nagurney, A., Sensitivity analysis for the general spatial economic equilibrium problem. Oper. Res. 32 (1984), 1069–1086.
48. Dafermos, S., Nagurney, A., Sensitivity analysis for the asymmetric network equilibrium problem. Math. Program. 28 (1984), 174–184.
49. Dafermos, S., Nagurney, A., On some traffic equilibrium theory paradoxes. Trans. Res. 18B (1984), 101–110.
50. Dafermos, S., Nagurney, A., Stability and sensitivity analysis for the general network equilibrium-travel choice model. Volmuller, J., Hamerslag, R., (eds.) Proceedings of the Ninth International Symposium on Transportation and Traffic Theory, Delft, 1984, VNU Science Press, Utrecht, 217–231.
51. Dafermos, S., Nagurney, A., Isomorphism between spatial price and traffic equilibrium models. Report LCDS #85-17, 1985, Lefschetz Center for Dynamical Systems, Brown University, Utrecht.
52. Dafermos, S., Nagurney, A., Supply and demand equilibration algorithms for a class of market equilibrium problems. Transp. Sci. 23 (1989), 118–124.
53. Dafermos, S., Sparrow, F.T., The traffic assignment problem for a general network. J. Res. Nat. Bur. Stand. 73B (1969), 91–118.
54. Dafermos, S., Sparrow, F.T., Optimal resource allocation and toll patterns in user-optimised transport networks. J. Trans. Econ. Policy 5 (1971), 184–200.
55. Daganzo, C.F., On the traffic assignment problem with flow dependent costs — 1. Trans. Res. 11 (1977), 433–437.
56. Daganzo, C.F., On the traffic assignment problem with flow dependent costs — 2. Trans. Res. 11 (1977), 439–441.
57. Daganzo, C.F., Unconstrained extremal formulations of some transportation equilibrium problems. Transp. Sci. 16 (1982), 332–360.
58. Daganzo, C.F., Stochastic network equilibrium with multiple vehicle types and asymmetric, indefinite link cost Jacobians. Transp. Sci. 17 (1983), 282–300.
59. Daganzo, C.F., Sheffi, Y., On stochastic models of traffic assignment. Transp. Sci. 11 (1977), 253–274.
60. Dantzig, G.B., Maier, S.F., Lansdowne, Z.F., The application of decomposition to transportation networks analysis. Report DOT-TSC-OST-76-26, 1976, U.S. Department of Transportation, Providence, RI.
61. Dembo, R.S., A primal truncated Newton algorithm with application to large-scale nonlinear network optimization. Math. Program. Study 31 (1987), 43–71.
62. Dembo, R.S., Klincewicz, J.G., A scale reduced gradient algorithm for network flow problems with convex separable costs. Math. Program. Study 15 (1981), 125–147.
63. Dembo, R.S., Tulowitzki, U., Computing equilibria on large multicommodity networks: an application of truncated quadratic programming algorithms. Networks 18 (1988), 273–284.
64. Dennis, J.B., Mathematical programming and electrical networks. 1959, MIT Press and John Wiley, Washington, D.C.
65. Dial, R.B., A probabilistic multipath traffic assignment model which obviates path enumeration. Trans. Res. 5 (1971), 83–111.
66. Dow, P., Van Vliet, D., Capacity restrained road assignment. Traffic Eng. Control 20 (1979), 296–305.
67. Drissi-Kaïtouni, O., Florian, M., An algorithm for the spatial price equilibrium problem on a general network in the space of path flows. J. Region. Sci. 31 (1991), 171–190.
68. Dupuis, C., Darveau, J.-M., The convergence conditions of diagonalization and projection methods for fixed demand asymmetric network equilibrium problems. Oper. Res. Lett. 5 (1986), 149–155.
69. Erlander, S., Nguyen, S., Stewart, N., On the calibration of the combined distribution-assignment model. Trans. Res. 13B (1979), 259–267.
70. Evans, S.P., Derivation and analysis of some models for combining trip distribution and assignment. Trans. Res. 10 (1976), 37–57.
71. Fang, S.-C., Traffic equilibria on multiclass-user transportation networks analysed via variational inequalities. Tamkang J. Math. 13 (1982), 1–9.
72. Ferland, J.A., Minimum cost multicommodity circulation problems with convex arc-costs. Transp. Sci. 8 (1974), 355–360.
73. Fernandez, J.E., Friesz, T.L., Equilibrium predictions in transportation markets: the state of the art. Trans. Res. 17B (1983), 155–172.
74. Fisk, C., More paradoxes in the equilibrium assignment problem. Trans. Res. 13B (1979), 305–309.
75. Fisk, C., Some developments in equilibrium traffic assignment. Trans. Res. 14B (1980), 243–255.
76. Fisk, C.S., Boyce, D.E., Alternative variational inequality formulations of the network equilibrium-travel choice problem. Transp. Sci. 17 (1983), 454–463.
77. Fisk, C., Nguyen, S., Existence and uniqueness properties of an asymmetric two-mode equilibrium model. Transp. Sci. 15 (1981), 318–328.
78. Fisk, C., Nguyen, S., Solution algorithms for network equilibrium models with asymmetric user costs. Transp. Sci. 16 (1982), 361–381.
79. Fisk, C., Pallottino, S., Empirical evidence for equilibrium paradoxes with implications for optimal planning strategies. Trans. Res. 15A (1981), 245–248.
80. Florian, M., An improved linear approximation algorithm for the network equilibrium (packet switching) problem. Proc. 1977 IEEE Conference on Decision and Control, New Orleans, TX, 1977, 812–818.
81. Florian, M., A traffic equilibrium model of travel by car and public transit modes. Transp. Sci. 8 (1976), 168–179.
82. Florian, M., Chapleau, R., Nguyen, S., Achim, C., James-Lefebvre, L., Fisk, C., Validation and application of EMME: an equilibrium based two-mode urban transportation planning method. Trans. Res. Record 728 (1979), 14–22.
83. Floridan, M., An introduction to network models used in transportation planning. Florian, M., (eds.) Transp. Plann. Models, 1984, North-Holland, NY, 137–152.
84. Florian, M., Nonlinear cost network models in transportation analysis. Math. Program. Study 26 (1986), 167–196.
85. Florian, M., Guélat, J., Spiess, H., An efficient implementation of the PARTAN variant of the linear approximation method for the network equilibrium problem. Networks 17 (1987), 319–339.
86. Florian, M., Los, M., A new look at static spatial price equilibrium problems. Region. Sci. Urban Econ. 12 (1982), 579–597.
87. Florian, M., Nguyen, S., A method for computing network equilibrium with elastic demands. Transp. Sci. 8 (1974), 321–332.
88. Florian, M., Nguyen, S., An application and validation of equilibrium trip assignment methods. Transp. Sci. 10 (1976), 374–390.
89. Florian, M., Nguyen, S., Recent experience with equilibrium methods for the study of a congested urban area. Florian, M.A., (eds.) Traffic Equilibrium Methods, Proceedings of the International Symposium in Montreal, Lecture Notes in Economics and Mathematical Systems 118, 1976, Springer-Verlag, Amsterdam, 382–395.
90. Florian, M., Nguyen, S., A combined trip distribution modal split and trip assignment model. Trans. Res. 12 (1978), 241–246.
91. Florian, M., Nguyen, S., Ferland, J., On the combined distribution-assignment of traffic. Transp. Sci. 9 (1975), 43–53.
92. Florian, M., Spiess, H., The convergence of diagonalization algorithms for asymmetric network equilibrium problems. Trans. Res. 16B (1982), 477–483.
93. Florian, M., Spiess, H., On binary mode choice/assignment models. Transp. Sci. 17 (1983), 32–47.
94. Frank, M., The Braess paradox. Math. Program. 20 (1981), 283–302.
95. Frank, M., The equilibrium worth of a network link. Transp. Sci. 23 (1989), 125–138.
96. Frank, M., Wolfe, P., An algorithm for quadratic programming. Nav. Res Logist. Q. 3 (1956), 95–110.
97. Fratta, L., Gerla, M., Kleinrock, L., The flow-deviation method: an approach to store-and-forward computer communication network design. Networks 3 (1973), 97–133.
98. Friesz, T.L., Transportation network equilibrium, design and aggregation: key developments and research opportunities. Trans. Res. 19A (1985), 413–427.
99. Friesz, T.L., Harker, P.T., Tobin, R.L., Alternative algorithms for the general network spatial price equilibrium problem. J. Region. Sci. 24 (1984), 475–507.
100. Fukushima, M., A modified Frank-Wolfe algorithm for solving the traffic assignment problem. Trans. Res. 18B (1984), 169–177.
101. Fukushima, M., On the dual approach to the traffic assignment problem. Trans. Res. 18B (1984), 235–245.
102. Fukushima, M., A relaxed projection method for variational inequalities. Math. Program. 35 (1986), 58–70.
103. Fukushima, M., Equivalent differentiable optimization problems and descent methods for assymmetric variational inequalities. Math. Program. 53 (1992), 99–110.
104. Gartner, N.H., Analysis and control of transportation networks by Frank-Wolfe decomposition. Proc. 7th Int. Symp. on Transportation and Traffic Theory, Kyoto, Japan, 1977, 591–623.
105. Gartner, N.H., Optimal traffic assignment with elastic demands: a review. Part I. Analysis framework. Transp. Sci. 14 (1980), 174–191.
106. Gartner, N.H., Optimal traffic assignment with elastic demands: a review. Part II. Algorithmic approaches. Transp. Sci. 14 (1980), 192–208.
107. Gibert, A., A method for the traffic assignment problem when demand is elastic. Report LBS-TNT-85, 1968, Transportation Network Theory Unit, London Business School, New York, NY.
108. Gibert, A., A method for the traffic assignment problem. Report LBS-TNT-95, 1968, Transportation Network Theory Unit, London Business School, London.
109. Goffin, J.L., Affine methods in nondifferentiable optimization. CORE Discussion paper No. 8744, 1987, Center for Operations Research and Econometrics, Université Catholique de Louvain, London, 24.
110. Guélat, J., Marcotte, P., Some comments on Wolfe's ‘away step’. Math. Program. 35 (1986), 110–119.
111. Hall, M.A., Hydraulic network analysis using (generalized) geometric programming. Networks 6 (1976), 105–130.
112. Hall, M.A., Properties of the equilibrium state in transportation networks. Transp. Sci. 12 (1978), 208–216.
113. Hall, M.A., Van Vliet, D., Willumsen, L.G., SATURN — A simulation assignment model for the evaluation of traffic management schemes. Traffic Eng. Control 21 (1980), 168–176.
114. Harker, P.T., A note on the existence of traffic equilibria. Appl. Math. Comput. 18 (1986), 277–283.
115. Harker, P.T., Accelerating the convergence of the diagonalization and projection algorithms for finite-dimensional variational inequalities. Math. Program. 41 (1988), 29–59.
116. Harker, P.T., Pang, J.-S., Finite-dimensional variational inequality and nonlinear complementarity problems: a survey of theory, algorithms and applications. Math. Program. 48 (1990), 161–220.
117. Hearn, D.W., Network aggregation in transportation planning models, Part I. Report DOT-TSC-RSPD-78-8, 1978, Mathetech, Louvain.
118. Hearn, D.W., Minimizing the gap function in certain convex programs. Network Aggregation in Transportation Planning Models Report DOT-TSC-RSPA-79-18, 1979, Mathtec, Princeton, NJ, 60–82.
119. Hearn, D.W., The gap function of a convex program. Oper. Res. Lett. 1 (1982), 67–71.
120. Hearn, D.W., Practical and theoretical aspects of aggregation problems in transportation planning models. Florian, M., (eds.) Transportation Planning Models, 1984, North-Holland, Princeton, NJ, 257–287.
121. Hearn, D.W., Lawphongpanich, S., A dual ascent algorithm for traffic assignment problems. Trans. Res. 24B (1990), 423–430.
122. Hearn, D.W., Lawphongpanich, S., Nguyen, S., Convex programming formulations of the asymmetric traffic assignment problem. Trans. Res. 18B (1984), 357–365.
123. Hearn, D.W., Lawphongpanich, S., Ventura, J.A., Finiteness in restricted simplicial decomposition. Operations Research Letters 4 (1985), 125–130.
124. Hearn, D.W., Lawphongpanich, S., Ventura, J.A., Restricted simplicial decomposition: computation and extensions. Math. Program. Study 31 (1987), 99–118.
125. Hearn, D.W., Lawphongpanich, S., Ventura, J.A., Yang, K.C., RSDNET — Restricted simplicial decomposition network code. Eur. J. Oper. Res. 38 (1989), 121–122.
126. Hearn, D.W., Nguyen, S., Dual and saddle functions related to the gap function. Research Report 82-4, 1982, Department of Industrial and Systems Engineering, University of Florida, Amsterdam.
127. Hearn, D.W., Ribera, J., Bounded flow equilibrium problems by penalty methods. Proc. 1980 IEEE International Conference on Circuits and Computers, 1980, 162–166.
128. Hearn, D.W., Ribera, J., Convergence of the Frank-Wolfe method for certain bounded variable traffic assignment problems. Trans. Res. 15B (1981), 437–442.
129. Helgason, R.V., Kennington, J.L., An efficient specialization of the convex simplex method for nonlinear network flow problems. Technical Report IEOR 77107, 1978, Department of Industrial Engineering and Operations Research, Southern Methodist University, Gainesville, FL.
130. Holloway, C.A., An extension of the Frank and Wolfe method of feasible directions. Math. Program. 6 (1974), 14–27.
131. Jewell, W.S., Models for traffic assignment. Trans. Res. 1 (1967), 31–46.
132. Jörnsten, K.O., A maximum entropy combined distribution and assignment model solved by Benders decomposition. Transp. Sci. 14 (1980), 262–276.
133. Kennington, J.L., Helgason, R.V., Algorithms for Network Programming. 1980, John Wiley & Sons, Dallas, TX.
134. Kinderlehrer, D., Stampacchia, G., An Introduction to Variational Inequalities and Their Applications. 1980, Academic Press, New York, NY.
135. Kleinrock, L., Communication Nets: Stochastic Message Flow and Delay. 1964, McGraw-Hill, New York, NY.
136. Klessig, R.W., An algorithm for nonlinear multicommodity flow problems. Networks 4 (1974), 343–355.
137. Klincewicz, J.G., A Newton method for convex separable network flow problems. Networks 13 (1983), 427–442.
138. Knight, F.H., Some fallacies in the interpretation of social costs. Q. J. Econ. 38 (1924), 582–606.
139. Kuhn, H.W., MacKinnon, J.G., Sandwich method for finding fixed points. J. Optim. Theory Appl. 17 (1975), 189–204.
140. Kyparisis, J., Sensitivity analysis framework for variational inequalities. Math. Program. 38 (1987), 203–213.
141. Larsson, T., Patricksson, M., A generalized gap function for variational inequalities. Department of Mathematics Research Report LITH-MAT-R-1990-18, 1991, Linköping University, New York, NY.
142. Larsson, T., Patricksson, M., Simplicial decomposition with disaggregated representation for the traffic assignment problem. Trans. Sci. 26 (1992), 4–17.
143. Lasdon, L.S., Waren, A.D., Survey of nonlinear programming applications. Oper. Res. 28 (1980), 1029–1073.
144. Lawphongpanich, S., Hearn, D.W., Simplicial decomposition of the asymmetric traffic assignment problem. Trans. Res. 18B (1984), 123–133.
145. Lawphongpanich, S., Hearn, D.W., Restricted simplicial decomposition with application to the traffic assignment problem. Ric. Oper. 38 (1986), 97–120.
146. Lawphongpanich, S., Hearn, D.W., Benders decomposition for variational inequalities. Math. Program. 48 (1990), 231–247.
147. LeBlanc, L.J., Farhangian, K., Efficient algorithms for solving elastic demand traffic assignment problems and mode split-assignment problems. Transp. Sci. 15 (1981), 306–317.
148. LeBlanc, L.J., Helgason, R.V., Boyce, D.E., Improved efficiency of the Frank-Wolfe algorithm for convex network programs. Transp. Sci. 19 (1985), 445–462.
149. LeBlanc, L.J., Morlok, E.K., Pierskalla, W.P., An accurate and efficient approach to equilibrium traffic assignment on congested networks. Trans. Res. Rec., 491, 1974, TRB — National Academy of Sciences, Linköping, 12–23.
150. LeBlanc, L.J., Morlok, E.K., Pierskalla, W.P., An efficient approach to solving the road network equilibrium traffic assignment problem. Trans. Res. 9 (1975), 309–318.
151. Leventhal, T., Nemhauser, G., Trotter, L. Jr., A column generation algorithm for optimal traffic assignment. Transp. Sci. 7 (1973), 168–176.
152. Lupi, M., Convergence of the Frank-Wolfe algorithm in transportation networks. Civ. Eng. Systems 3 (1986), 7–15.
153. MacKinnon, J.G., An algorithm for the generalized transportation problem. Region. Sci. Urban Econ. 5 (1975), 445–464.
154. Magnanti, T.L., Models and algorithms for predicting urban traffic equilibria. Florian, M., (eds.) Transportation Planning Models, 1984, North-Holland, Amsterdam, 153–185.
155. Magnanti, T.L., Golden, B.L., Transportation planning: network models and their implementation. Hax, A.C., (eds.) Studies in Operations Management, 1978, 465–518.
156. Mahmassani, H.S., Mouskos, K.C., Some numerical results on the diagonalization algorithm for network assignment with asymmetric interactions between cars and trucks. Trans. Res. 22B (1988), 275–290.
157. Marcotte, P., A new algorithm for solving variational inequalities with application to the traffic assignment problem. Math. Program. Study 33 (1985), 339–351.
158. Marcotte, P., Dussault, J.-P., A modified Newton method for solving variational inequalities. Proc. 24th IEEE Conf. on Decision and Control, Fort Lauderdale, FL, 1985, 1433–1436.
159. Marcotte, P., Dussault, J.-P., A note on a globally convergent Newton method for solving monotone variational inequalities. Oper. Res. Lett. 6 (1987), 35–42.
160. Marcotte, P., Guélat, J., Adaptation of a modified Newton method for solving the asymmetric traffic equilibrium problem. Transp. Sci. 22 (1988), 112–124.
161. Marcotte, P., Marquis, G., Zubieta, L., A Newton-SOR method for spatial price equilibrium. Transp. Sci. 26 (1992), 36–47.
162. Mirchandani, P., Soroush, H., Generalized traffic equilibrium with probabilistic travel times and perceptions. Transp. Sci. 21 (1987), 133–152.
163. Matematisches Forschungsinstitut, Oberwolfach, October 1969, II. Oberwolfach-Tagung über Operations Research, Operations Research-Verfahren 8 Murchland, J.D., Road network traffic distribution in equilibrium. Henn, R., Künzi, H.P., Schubert, H., (eds.) Proceedings of Mathematical Models in the Social Sciences, 1970, Anton Hain Verlag, Amsterdam, 145–183.
164. Murchland, J.D., Braess's paradox of traffic flow. Transp. Res. 4 (1970), 391–394.
165. Nagurney, A., Computational comparisons of spatial price equilibrium models. J. Region. Sci. 27 (1987), 55–76.
166. Nagurney, A., Competitive equilibrium problems, variational inequalities and regional science. J. Region. Sci. 27 (1987), 503–517.
167. Nagurney, A., An equilibration scheme for the traffic assignment problem with elastic demands. Trans. Res. 22B (1988), 73–79.
168. Nagurney, A., An algorithm for the solution of a quadratic programming problem with application to constrained matrix and spatial price equilibrium problems. Environ. Planning A 21 (1989), 99–114.
169. Nagurney, A., Network Economics: A Variational Inequality Approach. 1993, Kluwer, Academic Publishers, Meisenheim am Glan.
170. Nagurney, A., Kim, D.-S., Parallel and serial variational inequality decomposition algorithms for multicommodity market equilibrium problems. Int. J. Supercomput. Appl. 3 (1989), 34–58.
171. Netter, M., Equilibrium and marginal cost pricing on a road network with several flow types. Newell, G.F., (eds.) Traffic Flow and Transportation, Proceedings of the Fifth International Symposium on the Theory of Traffic Flow and Transportation, 1972, American Elsevier, Dordrecht, 155–163.
172. Netter, M., Affectations de trafic et tarification au coût marginal social: critique de quelques idées admises. Trans. Res. 6 (1972), 411–429.
173. Newell, G.F., Traffic Flow on Transportation Networks. 1980, MIT Press, New York, NY.
174. Nguyen, S., An algorithm for the traffic assignment problem. Transp. Sci. 8 (1974), 203–216.
175. Nguyen, S., A unified approach to equilibrium methods for traffic assignment. Florian, M.A., (eds.) Traffic Equilibrium Methods, Proceedings of the International Symposium in Montreal, Lecture Notes in Economics and Mathematical Systems 118, 1976, Springer-Verlag, Cambridge, MA, 148–182.
176. Nguyen, S., Dupuis, C., An efficient method for computing traffic equilibria in networks with asymmetric transportation costs. Transp. Sci. 18 (1984), 185–202.
177. Nguyen, S., James, L., TRAFFIC — an equilibrium traffic assignment program. Publication #17, 1975, Centre de Recherche sur les Transports, Université de Montréal, Berlin.
178. Pang, J.-S., Solution of the general multicommodity spatial equilibrium problem by variational and complementarity methods. J. Region. Sci. 24 (1984), 403–414.
179. Pang, J.-S., Asymmetric variational inequality problems over product sets: applications and iterative methods. Math. Program. 31 (1985), 206–219.
180. Pang, J.-S., Chan, D., Iterative methods for variational and complementarity problems. Math. Program. 24 (1982), 284–313.
181. Pang, J.-S., Yu, C.-S., Linearized simplicial decomposition methods for computing traffic equilibria on networks. Networks 14 (1984), 427–438.
182. Patricksson, M., Algorithms for urban traffic network equilibria. Linköping Studies in Science and Technology, Department of Mathematics, Thesis No. 263, 1991, Linköping University, Linköping.
183. Patricksson, M., The Traffic Assignment Problem — Models and Methods. 1994, VSP, Linköping.
184. Petersen, E.R., A primal-dual traffic assignment algorithm. Manage. Sci. 22 (1975), 87–95.
185. Academic Potts, R.B., Oliver, R.M., Flows in Transportation Networks. 1972, Press, Utrecht.
186. Powell, W.B., Sheffi, Y., The convergence of equilibrium algorithms with predetermined step sizes. Transp. Sci. 16 (1982), 45–55.
187. Qiu, Y., Magnanti, T.L., Sensitivity analysis for variational inequalities defined on polyhedral sets. Math. Oper. Res. 14 (1989), 410–432.
188. Qiu, Y., Magnanti, T.L., Sensitivity analysis for variational inequalities. Math. Oper. Res. 17 (1992), 61–76.
189. Rosenthal, R.W., The network equilibrium problem in integers. Networks 3 (1973), 53–59.
190. Bruges Ruiter, E.R., The prediction of network equilibrium: the state of the art. Proc. Int. Conf. on Transportation Research, 1973, 717–726.
191. Ruiter, E.R., Implementation of operational network equilibrium procedures. Trans. Res. Record 491 (1974), 40–51.
192. Samuelson, P.A., Spatial price equilibrium and linear programming. Am. Econ. Rev. 42 (1952), 283–303.
193. Serra, P., Weintraub, A., Convergence of decomposition algorithms for the traffic assignment problem. Hansen, P., (eds.) Studies on Graphs and Discrete Programming, Annals of Discrete Mathematics, 1981, North-Holland Publishing Company, New York, NY, 313–318.
194. Shah, B.V., Buehler, R.J., Kempthorne, O., Some algorithms for minimizing a function of several variables. SIAM J. Appl. Math. 12 (1964), 74–92.
195. Sheffi, Y., Urban Transportation Networks. Equilibrium Analysis with Mathematical Programming Methods. 1985, Prentice-Hall, Englewood Cliffs, NJ.
196. Sheffi, Y., Powell, W., A comparison of stochastic and deterministic traffic assignment over congested networks. Trans. Res. 15B (1981), 53–64.
197. Sheffi, Y., Powell, W., An algorithm for the equilibrium assignment problem with random link times. Networks 12 (1982), 191–207.
198. Smith, M.J., The marginal cost taxation of a transportation network. Trans. Res. 13B (1979), 237–242.
199. Smith, M.J., Existence, uniqueness and stability of traffic equilibria. Trans. Res. 13B (1979), 295–304.
200. Smith, M.J., The existence and calculation of traffic equilibria. Trans. Res. 17B (1983), 291–303.
201. Smith, M.J., An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function. Trans. Res. 17B (1983), 365–371.
202. Smith, M.J., Two alternative definitions of traffic equilibrium. Trans. Res. 18B (1984), 63–65.
203. Soumis, F., Planification d'une flotte d'avions. Publication #133, 1978, Centre for Research on Transportation, Université de Montréal, Englewood Cliffs, NJ.
204. Steenbrink, P.A., Optimization of Transport Networks. 1974, John Wiley & Sons, London.
205. Steinberg, R., Stone, R.E., The prevalence of paradoxes in transportation equilibrium problems. Transp. Sci. 22 (1988), 231–241.
206. Steinberg, R., Zangwill, W.I., The prevalence of Braess' paradox. Transp. Sci. 17 (1983), 301–318.
207. Stewart, N.F., Equilibrium vs. system-optimal flow: some examples. Trans. Res. 14A (1980), 81–84.
208. Takayama, T., Judge, G., Equilibrium among spatially separated markets: A reformulation. Econometrica 32 (1964), 510–524.
209. Takayama, T., Judge, G., Spatial and temporal price and allocation models. 1971, North-Holland, London.
210. Tanner, J.C., Pricing the use of the roads — a mathematical and numerical study. Proc. 2nd Int. Symp. on the Theory of Traffic Flow, London, 1963, 317–345.
211. Tobin, R.L., Calculation of fuel consumption due to traffic congestion in a case-study metropolitan area. Traffic Eng. Control 20 (1979), 101–113.
212. Tobin, R.L., Sensitivity analysis for general spatial price equilibria. J. Region. Sci. 27 (1987), 77–102.
213. Tobin, R.L., Friesz, T.L., Sensitivity analysis for equilibrium network flow. Transp. Sci. 22 (1988), 242–250.
214. Van Vliet, D., Road assignment — I. Principles and parameters of model formulation. Trans. Res. 10 (1976), 137–143.
215. Van Vliet, D., Road assignment — II. The GLTS model. Transp. Res. 10 (1976), 145–149.
216. Van Vliet, D., Road assignment — III. Comparative tests of stochastic methods. Trans. Res. 10 (1976), 151–157.
217. Ventura, J., Hearn, D.W., Computing the effective resistance in a system of conducting sticks. Comput. Ind. Eng. 14 (1988), 171–179.
218. von Hohenbalken, B., A finite algorithm to maximize certain pseudoconcave functions on polytopes. Math. Program. 9 (1975), 189–206.
219. von Hohenbalken, B., Simplicial decomposition in nonlinear programming algorithms. Math. Program. 13 (1977), 49–68.
220. Part II Wardrop, J.G., Some theoretical aspects of road traffic research. Proc. Institute of Civil Engineers, 1952, 325–378.
221. Weintraub, A., A primal algorithm to solve network flow problems with convex costs. Manage. Sci. 21 (1974), 87–97.
222. Weintraub, A., Gonzáles, J., An algorithm for the traffic assignment problem. Networks 10 (1980), 197–209.
223. Weintraub, A., Ortiz, C., González, J., Accelerating convergence of the Frank-Wolfe algorithm. Trans. Res. 19B (1985), 113–122.
224. Wolfe, P., Convergence theory in nonlinear programming. Abadie, J., (eds.) Integer and Nonlinear Programming, 1970, North-Holland, Amsterdam, 1–36.
225. Wu, J.H., Florian, M., Marcotte, P., A general descent framework for the montone variational inequality problem. Publication #723, 1990, Centre de Recherche sur les Transports, Université de Montréal, Amsterdam.
226. Wu, J.H., Florian, M., Marcotte, P., A new optimization formulation of the variational inequality problem with application to the network equilibrium problem. Publication #722, 1991, Centre de Recherche sur les Transports, Université de Montréal, Montréal.
227. Zuhovickiľ, S.I., Poljak, R.A., Primak, M.E., Two methods of search for equilibrium points of n-person concave games. Sov. Math. Dokl. 10 (1969), 279–282.