All Outputs (2)

Bounds and algorithms for limited packings in graphs (2014)
Presentation / Conference
Gagarin, A., & Zverovich, V. (2014, June). Bounds and algorithms for limited packings in graphs. Paper presented at The 9th International Colloquium on Graph Theory and Combinatorics, Grenoble, France

Braess' paradox in a generalised traffic network (2014)
Journal Article
Zverovich, V., & Avineri, E. (2015). Braess' paradox in a generalised traffic network. Journal of Advanced Transportation, 49(1), 114-138. https://doi.org/10.1002/atr.1269

Copyright © 2014 John Wiley & Sons, Ltd. Braess' paradox illustrates situations when adding a new link to a transport network might lead to an equilibrium state in which travel times of users will increase. The classical network configuration intro... Read More about Braess' paradox in a generalised traffic network.