BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK

DOI10.15807/jorsj.25.376zbMath0502.90025OpenAlexW2569164216MaRDI QIDQ3968725

Azuma Taguchi

Publication date: 1982

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.25.376

zbMATH Keywords

Braess' paradoxcreation of a new branchoptimal origin-destination pathsingle commodity two-terminal transportation networkuser optimizing assignment problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Applications of mathematical programming (90C90) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10)

Related Items (6)

Degrading network capacity may improve performance: private versus public monitoring in the Braess paradox ⋮ On the severity of Braess's paradox: designing networks for selfish users is hard ⋮ Braess's Paradox in large random graphs ⋮ Minimal-time mean field games ⋮ Escaping Braess's paradox through approximate Caratheodory's theorem ⋮ Theory of uncontrollable flows -- a new type of network-flow theory as a model for the 21st century of multiple values

This page was built for publication: BRAESS' PARADOX IN A TWO-TERMINAL TRANSPORTATION NETWORK