1. Azar, Y., Epstein, A.: The hardness of network design for unsplittable flow with selfish users. In: Erlebach, T., Persinao, G. (eds.) Approximation and Online Algorithms, Lecture Notes in Computer Science, vol. 3879, pp. 41–54. Springer Berlin Heidelberg (2006)
2. Beckmann, M., McGuire, B., Winsten, C.B: Studies in the Economics of Transportation. Technical report (1956)
3. Bell, M.G.H., Iida, Y.: Transportation Network Analysis (1997)
4. Braess, D.: Über ein paradoxon aus der verkehrsplanung. Unternehmensforschung 12(1), 258–268 (1968)
5. Cenciarelli, P., Gorla, D., Salvo, I.: Graph theoretic investigations on inefficiencies in network models. Discret. Math. (2016). arXiv: 1603.01983