Show simple item record

dc.contributor.authorBarton, Russell R.
dc.contributor.authorHearn, Donald W.
dc.contributor.authorLawphongpanich, Siriphong
dc.date.accessioned2014-08-27T23:24:34Z
dc.date.available2014-08-27T23:24:34Z
dc.date.issued1989
dc.identifier.citationTranspt. Res.-B, Vol. 23B, No. 1, pp. 61-73, 1989
dc.identifier.urihttp://hdl.handle.net/10945/43132
dc.description.abstractIn prior work we have given an intuitive development of Transfer Decomposition, a decomposition of the traffic assignment problem into two traffic assignment problems. The intent of this paper is to provide a rigorous basis for this technique by establishing that it is a generalized Benders decomposition. As an illustration of the result, we give a decomposition algorithm that is based on the familiar Frank-Wolfe method.en_US
dc.description.sponsorshipThis research was supported in part by the National Science Foundation under Grant CEE-8420830.en_US
dc.rightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. As such, it is in the public domain, and under the provisions of Title 17, United States Code, Section 105, may not be copyrighted.en_US
dc.titleThe equivalence of transfer and generalized benders decomposition methods for traffic assignmenten_US
dc.typeArticleen_US
dc.contributor.departmentOperations Research


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record