|
Volumn 31, Issue 5, 1997, Pages 379-388
|
Braess paradox: Maximum penalty in a minimal critical network
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPUTATIONAL COMPLEXITY;
GRAPHIC METHODS;
SENSITIVITY ANALYSIS;
TOPOLOGY;
BRAESS PARADOX;
MINIMAL CRITICAL NETWORK;
MOTOR TRANSPORTATION;
|
EID: 0031233051
PISSN: 09658564
EISSN: None
Source Type: Journal
DOI: 10.1016/S0965-8564(96)00032-8 Document Type: Article |
Times cited : (34)
|
References (12)
|