@article{ref1,
title="Formulating and solving the network design problem by decomposition",
journal="Transportation research part B: methodological",
year="1979",
author="Dantzig, George B. and Harvey, Roy P. and Lansdowne, Zachary F. and Robinson, David W. and Maier, Steven F.",
volume="13",
number="1",
pages="5-17",
abstract="The optimal transportation network design problem is formulated as a convex nonlinear programming problem and a solution method based on standard traffic assignment algorithms is presented. The technique can deal with network improvements which introduce new links, which increase the capacity of existing links, or which decrease the free-flow (uncongested) travel time on existing links (with or without simultaneously increasing link capacity). Preliminary computational experience with the method demonstrates that it is capable of solving very large problems with reasonable amounts of computer time.<p /><p>Language: en</p>",
language="en",
issn="0191-2615",
doi="10.1016/0191-2615(79)90003-1",
url="http://dx.doi.org/10.1016/0191-2615(79)90003-1"
}