Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, HJ | en_US |
dc.contributor.author | Smith, TE | en_US |
dc.contributor.author | Friesz, TL | en_US |
dc.date.accessioned | 2014-12-08T15:45:51Z | - |
dc.date.available | 2014-12-08T15:45:51Z | - |
dc.date.issued | 2000-01-01 | en_US |
dc.identifier.issn | 0191-2615 | en_US |
dc.identifier.uri | http://dx.doi.org/10.1016/S0191-2615(99)00011-9 | en_US |
dc.identifier.uri | http://hdl.handle.net/11536/30828 | - |
dc.description.abstract | A reduction method is proposed which allows standard sensitivity techniques for variational inequalities to applied to equilibrium network flow problems without additional assumptions on either the underlying network or the numbers of active paths. In particular it is shown that under mild regularity conditions, small perturbations of equilibria can be given an explicit are-flow representation which is free of path-flow variables. It is also shown that this reduced form allows the differentiability of perturbations to be studied by standard methods. These results are illustrated by a small numerical example. (C) 1999 Elsevier Science Ltd. All rights reserved. | en_US |
dc.language.iso | en_US | en_US |
dc.title | A reduction method for local sensitivity analyses of network equilibrium arc flows | en_US |
dc.type | Article | en_US |
dc.identifier.doi | 10.1016/S0191-2615(99)00011-9 | en_US |
dc.identifier.journal | TRANSPORTATION RESEARCH PART B-METHODOLOGICAL | en_US |
dc.citation.volume | 34 | en_US |
dc.citation.issue | 1 | en_US |
dc.citation.spage | 31 | en_US |
dc.citation.epage | 51 | en_US |
dc.contributor.department | 運輸與物流管理系 註:原交通所+運管所 | zh_TW |
dc.contributor.department | Department of Transportation and Logistics Management | en_US |
dc.identifier.wosnumber | WOS:000083804100003 | - |
dc.citation.woscount | 15 | - |
Appears in Collections: | Articles |
Files in This Item:
If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.