An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem

Related Items (13)

A framework for and empirical study of algorithms for traffic assignment ⋮ A review of congestion models in the location of facilities with immobile servers ⋮ A survey of some mathematical programming models in transportation ⋮ A heuristic method for the minimum toll booth problem ⋮ An alternating direction method of multipliers for solving user equilibrium problem ⋮ Models and Software for Urban and Regional Transportation Planning: The Contributions of the Center for Research on Transportation ⋮ Combined signal setting design and traffic assignment problem. ⋮ Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints ⋮ Traffic equilibrium with a continuously distributed bound on travel weights: the rise of range anxiety and mental account ⋮ Efficient implementation of heuristics for the continuous network design problem ⋮ A heuristic algorithm for network equilibration ⋮ Traffic Networks and Flows over Time ⋮ Postoptimizing equilibrium flows on large scale networks

Cites Work

This page was built for publication: An efficient implementation of the “partan” variant of the linear approximation method for the network equilibrium problem