Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints
MetadataShow full item record
The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network ow problem is simply its linear approximation. Instead of solving the subproblem optimally, this paper demonstrates that performing one iteration of Dantzig-Wolfe decomposition is generally suffi cient for SD to effi ciently converge to an optimal solution.
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.