Author:
Macko Martin,Larson Kate,Steskal Ľuboš
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Theoretical Computer Science
Reference19 articles.
1. Akamatsu, T., Heydecker, B.: Detecting dynamic traffic assignment capacity paradoxes in saturated networks. Transp. Sci. 37(2), 123–138 (2003)
2. Braess, D.: Uber ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12, 258–268 (1968). English translation in [3]
3. Braess, D., Nagurney, A., Wakolbinger, T.: On a paradox of traffic planning. Transp. Sci. 39(4), 446–450 (2005)
4. Duffin, R.J.: Topology of series-parallel networks. J. Math. Anal. Appl. 10, 303–318 (1965)
5. Ford, L.R., Fulkerson, D.R.: Constructing maximal dynamic flows from static flows. Oper. Res. 6(3), 419–433 (1958)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献