Simplicial with truncated Dantzig-Wolfe decomposition for nonlinear multicommodity network flow problems with side constraints

Authors:
Siriphong Lawphongpanich
Affiliations:
Department of Operations Research, Naval Postgraduate School, 1411 Cunningham Road, Monterey, CA 93943, USA
Venue:
Operations Research Letters
Year:
2000

Citing 3
Cited 1

Network flows: theory, algorithms, and applications

Network flows: theory, algorithms, and applications
Solving nonlinear multicommodity flow problems by the analytic center cutting plane method

Mathematical Programming: Series A and B - Special issue: interior point methods in theory and practice
Algorithms for Network Programming

Algorithms for Network Programming

Congestion Pricing for Schedule-Based Transit Networks

Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The simplicial decomposition (SD) subproblem for a nonlinear multicommodity network flow 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 sufficient for SD to efficiently converge to an optimal solution.