Network-Optimized Road Pricing: Part II: Algorithms and Examples

References

• Ahuja R., Magnanti T., Orlin J.Network Flows (1993) (Prentice Hall, New York) Google Scholar
• Bergendorft P., Hearn D., Ramana M. Congestion toll pricing in traffic networks. (1996) . Research report 96-1, Department of Industrial and Systems Engineering, University of Florida, GainsvilleGoogle Scholar
• Cottle R., Pang J.-S., Stone R.The Linear Complementarity Problem (1992) (Academic Press, New York) Google Scholar
• Dial R. Bicriterion traffic assignment: Basic theory and elementary algorithms. Transportation Sci. (1996a) 30(2):93–111Link, Google Scholar
• Dial R. Bicriterion traffic assignment: Efficient algorithms plus examples. Transportation Res. (1996b) B31(1):357–359Google Scholar
• Dial R. Network-optimized road pricing: Part I: A parable and a model. Oper. Res. (1999) 47(1):54–64Link, Google Scholar
• Friesz T., Tobin R., Cho H., Metha N. Sensitivity analysis-based heuristic algorithms for mathematical programs with variational inequality constraints. Math. Programming (1990) 48(1):265–284Crossref, Google Scholar
• Harker P., Pang J.-S. Finite dimensional variational inequality and nonlinear complementary problems: A survey of theory, algorithms and applications. Math. Programming (1990) 48:49–68Crossref, Google Scholar
• Hearn D., Lawphongpanich S. Simplicial decomposition of the asymmetric traffic assignment problem. Transportation Res. (1984) 18B(2):123–133Google Scholar
• Hearn D., Lawphongpanich S., Ventura J. Restricted simplicial decomposition: Computation and extensions. Math. Programming Stud. (1987) 31:99–118Crossref, Google Scholar
• Janson B. Dynamic traffic assignment for urban road networks. Transportation Res. (1991) 25B:143–161Crossref, Google Scholar
• Lemke C. E. Some pivot schemes for the linear complementarity problem. Math. Programming Stud. (1978) 7:15–35Crossref, Google Scholar
• Magnanti T., Perakis G. On the convergence of classical variational inequality algorithms. (1993a) . Working paper OR 282-93, Operations Research Center, MIT, Cambridge, MAGoogle Scholar
• Magnanti T., Perakis G. A unifying geometric solution framework and complexity analysis for variational inequalities. (1993b) . Working paper OR 276-93, Operations Research Center, MIT, Cambridge, MAGoogle Scholar
• Magnanti T., Perakis G. From Frank-Wolfe to steepest descent: A descent framework for solving VIPs. (1994a) . Presentation at TIMS/ORSA Joint National Meeting, Boston, MAGoogle Scholar
• Magnanti T., Perakis G. From Frank-Wolfe to steepest descent: A descent framework for solving VIPs. (1994b) . Presentation at TIMS/ORSA Joint National Meeting, Boston, MAGoogle Scholar
• Orlin J. 2-criteria and 3-criteria shortest path problem: A proposal. (1993) . Personal Correspondence, MIT, Cambridge, MAGoogle Scholar
• Rockafellar R. T.Network Flows and Monotropic Optimization (1984) (John Wiley & Sons, New York) Google Scholar
• Smith M. J. An algorithm for solving asymmetric equilibrium problems with a continuous cost-flow function. Transportation Res. (1983) 17B:365–371Crossref, Google Scholar
• Von Hohenbalken B. Simplicial decomposition in nonlinear programming problems. Math. Programming (1977) 13:49–68Crossref, Google Scholar
• Wardrop J. Some theoretical aspects of road traffic research. Proc. Inst. Civil Engineers, Part 2 (1952) 325–378Crossref, Google Scholar